On planar greedy drawings of 3-connected planar graphs

DOI10.4230/LIPICS.SOCG.2017.33zbMATH Open1432.68346OpenAlexW2809128801MaRDI QIDQ4580108FDOQ4580108

Authors Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati 

Publication date 13 August 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.SoCG.2017.33

zbMATH Keywords

planar graphs3-connectivityconvex drawingsgreedy drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On planar greedy drawings of 3-connected planar graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• On succinct convex greedy drawing of 3-connected plane graphs
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs

Cited In (20)

• On the plane angle-monotone graphs
• Angle-monotonicity of Delaunay triangulation
• On planar greedy drawings of 3-connected planar graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Succinct greedy drawings do not always exist
• Greedy rectilinear drawings
• Greedy rectilinear drawings
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
• (Weakly) self-approaching geometric graphs and spanners
• On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
• On succinct convex greedy drawing of 3-connected plane graphs
• On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
• Drawing graphs as spanners
• Succinct greedy drawings do not always exist
• On self-approaching and increasing-chord drawings of 3-connected planar graphs
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• Every Schnyder drawing is a greedy embedding
• Euclidean greedy drawings of trees
• Euclidean greedy drawings of trees

This page was built for publication: On planar greedy drawings of 3-connected planar graphs

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