Strictly-convex drawings of 3-connected planar graphs

DOI10.1007/978-3-031-22203-0_11arXiv2208.13388OpenAlexW4317393943MaRDI QIDQ6117042

Martin Gronemann, Michael A. Bekos, Antonios Symvonis, Fabrizio Montecchiani

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.13388

zbMATH Keywords

planar graphsarea boundsstrictly-convex drawings

Mathematics Subject Classification ID

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

Related Items (1)

Convex grid drawings of planar graphs with constant edge-vertex resolution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for drawing a planar graph on a grid
• A refinement of Kuratowski's theorem
• How to draw a planar graph on a grid
• Strictly convex drawings of planar graphs
• Output-sensitive reporting of disjoint paths
• Grid embedding of 4-connected plane graphs
• Drawing planar graphs using the canonical ordering
• Convex grid drawings of planar graphs with constant edge-vertex resolution
• Grid drawings of graphs with constant edge-vertex resolution
• Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
• How to Draw a Graph
• Algorithms and Data Structures
• Grid drawings of 4-connected plane graphs
• Convex drawings of planar graphs and the order dimension of 3-polytopes

This page was built for publication: Strictly-convex drawings of 3-connected planar graphs