Drawing planar graphs with few segments on a polynomial grid

DOI10.1007/978-3-030-35802-0_32OpenAlexW2990860393MaRDI QIDQ2206874

Thomas Schneck, Antonios Symvonis, Tamara Mchedlidze, Philipp Kindermann

Publication date: 26 October 2020

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

Mathematics Subject Classification ID

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

Related Items

The segment number: algorithms and universal lower bounds for some classes of planar graphs ⋮ An annotated review on graph drawing and its applications ⋮ Variants of the segment number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Good spanning trees in graph drawing
• Schnyder woods and orthogonal surfaces
• Output-sensitive reporting of disjoint paths
• Drawing plane triangulations with few segments
• Minimum-segment convex drawings of 3-connected cubic plane graphs
• Drawings of planar graphs with few slopes and segments
• The complexity of drawing graphs on few lines and few planes
• Drawing graphs on few circles and few spheres
• A Note on Minimum-Segment Drawings of Planar Graphs
• Drawing Graphs on Few Lines and Few Planes
• Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
• Drawability of Complete Graphs Using a Minimal Slope Set
• Drawing Planar Graphs with Few Geometric Primitives
• CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS
• Experimental Analysis of the Accessibility of Drawings with Few Segments
• Orderly Spanning Trees with Applications
• Monotone Drawings of Graphs
• Drawing Graphs with Few Arcs

This page was built for publication: Drawing planar graphs with few segments on a polynomial grid