Planar Graph Drawing
The book presents the important fundamental theorems and algorithms on planar graph drawing with easy-to-understand and constructive proofs. Extensively illustrated and with exercises included at the end of each chapter, it is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph theory, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference source for researchers in the field of graph drawing and software developers in information visualization, VLSI design and CAD.
Was andere dazu sagen - Rezension schreiben
Es wurden keine Rezensionen gefunden.
Andere Ausgaben - Alle anzeigen
2-connected plane graph 2-legged 3-connected cubic graph 3-legged cycle 4-canonical ordering adjacency lists algorithm to find angles bad cycle box-rectangular drawing canonical decomposition child-cycles clockwise Co(G convex drawing convex polygon corner boxes counterclockwise critical separation pair cut vertex cycle in G cycle of G degree three depth-first search drawing of G drawn by thick edge of G embedding of G face F face of G facial cycle floorplanning following lemma four outer vertices G in Fig graph drawing graph G graph in Fig green path grid drawing hence illustrated in Fig inner face leg-vertices Let G line segment linear algorithm lºu lºw neighbors node orthogonal drawing outer cycle outer edge outer face planar plane embedding Pºe PQ-tree proof rectangle rectangular drawing satisfies Condition Schnyder labeling Section slicing graph split graphs straight line drawing subgraph tree triangulated plane graph vertices of degree vertices of G y}-split components