On Area-Optimal Planar Graph Drawings

DOI10.1007/978-3-662-43948-7_17MaRDI QIDQ5167742zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Therese Biedl

Publication date 1 July 2014

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43948-7_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Graph Drawing
• Towards area requirements for drawing hierarchically planar graphs
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• Area-efficient planar straight-line drawings of outerplanar graphs
• scientific article; zbMATH DE number 219263
• scientific article; zbMATH DE number 1974107
• On the area requirements of planar greedy drawings of triconnected planar graphs
• A note on minimum-segment drawings of planar graphs

Cited in

(16)

• Constructing compact rectilinear planar layouts using canonical representation of planar graphs
• Towards area requirements for drawing hierarchically planar graphs
• Optimal enclosing regions in planar graphs
• h-quasi planar drawings of bounded treewidth graphs in linear area
• scientific article; zbMATH DE number 219263 (Why is no real title available?)
• Drawing planar graphs on \(\frac{8}{9}n^2\) area
• Positive planar satisfiability problems under 3-connectivity constraints
• On upward drawings of trees on a given grid
• ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
• Minimizing the Area for Planar Straight-Line Grid Drawings
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• Area-efficient planar straight-line drawings of outerplanar graphs
• Area, curve complexity, and crossing resolution of non-planar graph drawings
• scientific article; zbMATH DE number 1953080 (Why is no real title available?)
• Faster algorithms for grid and layered drawings of plane 3-trees
• Drawn tree decomposition: new approach for graph drawing problems

This page was built for publication: On Area-Optimal Planar Graph Drawings

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