Monotone Drawings of 3-Connected Plane Graphs

DOI10.1007/978-3-662-48350-3_61zbMath1466.68060OpenAlexW2396551607MaRDI QIDQ3452836

Dayu He, Xin He

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_61

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Connectivity (05C40)

Related Items (6)

Optimal Monotone Drawings of Trees ⋮ Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition ⋮ Monotone drawings of \(k\)-inner planar graphs ⋮ Monotone drawings of graphs with few directions ⋮ Every Schnyder drawing is a greedy embedding ⋮ Drawing graphs as spanners

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• Strictly convex drawings of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Output-sensitive reporting of disjoint paths
• Monotone drawings of graphs with fixed embedding
• On a conjecture related to geometric routing
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Monotone Drawings of Trees
• Monotone Grid Drawings of Planar Graphs
• Graph Drawing
• Monotone Drawings of Graphs
• An Algorithm to Construct Greedy Drawings of Triangulations
• Convex drawings of planar graphs and the order dimension of 3-polytopes

This page was built for publication: Monotone Drawings of 3-Connected Plane Graphs