Constructing compact rectilinear planar layouts using canonical representation of planar graphs

DOI10.1016/0304-3975(92)90349-KzbMath0761.68076MaRDI QIDQ1193898

Jyrki Nummenmaa

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

visibility representationcanonical numberinghorvert-representation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Drawing planar graphs using the canonical ordering, Special graph representation and visualization of semantic networks, A more compact visibility representation, Width-Optimal Visibility Representations of Plane Graphs, A theory of L-shaped floor-plans

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Parallel concepts in graph theory
• Planar embedding: linear-time algorithms for vertex placement and edge orderings
• Universality considerations in VLSI circuits
• Efficient Planarity Testing