Minimizing the Area for Planar Straight-Line Grid Drawings

DOI10.1007/978-3-540-77537-9_21zbMATH Open1137.68497OpenAlexW1567245832MaRDI QIDQ5452224FDOQ5452224

Authors: Marcus Krug, Dorothea Wagner 

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_21

Recommendations

• On Area-Optimal Planar Graph Drawings
• Minimum-area drawings of plane 3-trees
• scientific article; zbMATH DE number 1990911
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• Drawing planar graphs on \(\frac{8}{9}n^2\) area

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (7)

• The stub resolution of 1-planar graphs
• Snapping graph drawings to the grid optimally
• On upward drawings of trees on a given grid
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• How to fit a tree in a box
• The point-set embeddability problem for plane graphs
• Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions

This page was built for publication: Minimizing the Area for Planar Straight-Line Grid Drawings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452224)