Minimizing the Area for Planar Straight-Line Grid Drawings

DOI10.1007/978-3-540-77537-9_21zbMath1137.68497OpenAlexW1567245832MaRDI QIDQ5452224

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

Mathematics Subject Classification ID

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

Related Items (6)

The Stub Resolution of 1-planar Graphs ⋮ Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions ⋮ Snapping Graph Drawings to the Grid Optimally ⋮ On Upward Drawings of Trees on a Given Grid ⋮ How to fit a tree in a box ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS

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