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.
Graph Theoretic Foundations
Straight Line Drawing
Andere Ausgaben - Alle anzeigen
2-connected plane 2-legged 3-legged cycle 4-canonical 9raph adjacency lists algorithm to find angles Au(v bad cycle bc(C box-rectangular drawing canonical decomposition child-cycles clockwise convex drawing convex polygon corner boxes counterclockwise critical separation pair cubic graph cut vertex cycle in G cycle of G degree three denote depth-first search drawing of G drawn by thick ed9e face F face of G facial cycle floorplanning following lemma four outer vertices G in Fig G(Ci Gk-i graph drawing graph G graph in Fig green path grid drawing hence illustrated in Fig inner face leg-vertices Lemma Let G line segment linear algorithm neighbors node orthogonal drawing outer cycle outer edge outer face Pc and Pcc planar plane embedding PQ-tree proof rectan9ular drawin9 rectangle rectangular drawing satisfies Condition Schnyder labeling Section slicing graph straight line drawing subgraph subtree tree triangle triangulated plane graph vertices of degree vertices of G ymax