Straight-line drawings of outerplanar graphs in O(dn n) area

DOI10.1016/J.COMGEO.2010.03.007zbMATH Open1253.68261OpenAlexW2174713390MaRDI QIDQ452455FDOQ452455

Authors: Fabrizio Frati 

Publication date: 21 September 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.03.007

Recommendations

• Graph Drawing
• Area-efficient planar straight-line drawings of outerplanar graphs
• scientific article; zbMATH DE number 1974107
• Small area drawings of outerplanar graphs
• Graph Drawing

zbMATH Keywords

graph drawingouterplanar graphsminimum areagrid drawingsstraight-line drawings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)

Cites Work

• How to draw a planar graph on a grid
• A note on optimal area algorithms for upward drawings of binary trees
• Small area drawings of outerplanar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Triangulating planar graphs while minimizing the maximum degree
• Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract)
• Title not available (Why is that?)
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Graph Drawing
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• Graph Drawing
• Area-efficient planar straight-line drawings of outerplanar graphs

Cited In (15)

• A linear-time algorithm for testing outer-1-planarity
• Outer 1-planar graphs
• Title not available (Why is that?)
• Graph Drawing
• Graph Drawing
• Area-efficient planar straight-line drawings of outerplanar graphs
• On some properties of doughnut graphs
• Drawing Halin-graphs with small height
• Computing β-Drawings of 2-Outerplane Graphs in Linear Time
• Planar rectilinear drawings of outerplanar graphs in linear time
• Area requirement of graph drawings with few crossings per edge
• Drawing graphs in the plane with a prescribed outer face and polynomial area
• On some properties of doughnut graphs (extended abstract)
• SOFSEM 2005: Theory and Practice of Computer Science
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size

This page was built for publication: Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area

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