Planar Graph DrawingWorld Scientific, 2004 - 295 Seiten 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. |
Inhalt
Graph Drawing | 1 |
Graph Theoretic Foundations | 19 |
Algorithmic Foundations | 33 |
Straight Line Drawing | 45 |
Convex Drawing | 89 |
Rectangular Drawing | 129 |
BoxRectangular Drawing | 175 |
Orthogonal Drawing | 197 |
Octagonal Drawing | 233 |
Appendix A Planar Embedding | 253 |
Finding Planar Embedding | 266 |
| 281 | |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
2-connected plane graph 2-legged 3-connected cubic graph 3-legged cycle adjacency lists algorithm to find angles Au(v bad cycle bc(C box-rectangular drawing C₁ canonical decomposition child-cycles clockwise Co(G convex drawing convex polygon corner boxes critical separation pair cubic graph cut vertex cycle in G cycle of G degree three depth-first search drawing of G drawn by thick embedding of G face F facial cycle floorplanning following lemma four outer vertices G in Fig G₁ 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 neighbors node orthogonal drawing outer cycle outer edge outer face plane embedding PQ-tree proof rectangle rectangular drawing satisfies Condition Schnyder labeling Section slicing graph split graphs straight line drawing subgraph tree triangulated plane graph U₁ v₁ vertex of G vertices of degree w₁ Wp+1 y-coordinates y(Uk Ymaz