A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
DOI10.1007/978-3-540-77537-9_33zbMATH Open1137.68489OpenAlexW2122573548MaRDI QIDQ5452236FDOQ5452236
Authors: Fabrizio Frati, Maurizio Patrignani 
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_33
Recommendations
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 (18)
- Large angle crossing drawings of planar graphs in subquadratic area
- Universal point sets for planar three-trees
- Minimum-area drawings of plane 3-trees
- Free edge lengths in plane graphs
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Drawing planar graphs on \(\frac{8}{9}n^2\) area
- Drawing Planar Graphs with Reduced Height
- Minimizing the Area for Planar Straight-Line Grid Drawings
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- Graph Stories in Small Area
- Cubic Planar Graphs that cannot be Drawn on few Lines
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs
- Area-efficient planar straight-line drawings of outerplanar graphs
- A Lower Bound on the Area Requirements of Series-Parallel Graphs
- On Area-Optimal Planar Graph Drawings
- Outerspatial 2-complexes: extending the class of outerplanar graphs to three dimensions
- Improved lower bounds on the area requirements of series-parallel graphs
- Graph stories in small area
This page was built for publication: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452236)
