Drawing plane triangulations with few segments
From MaRDI portal
Publication:1622344
DOI10.1016/j.comgeo.2018.02.003zbMath1506.68070MaRDI QIDQ1622344
Debajyoti Mondal, Stephane Durocher
Publication date: 19 November 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2018.02.003
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Drawing planar graphs with few segments on a polynomial grid, Drawing Graphs on Few Lines and Few Planes, Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- Intersection graphs of segments
- Drawing planar graphs with few geometric primitives
- Canonical ordering trees and their applications in graph drawing
- Drawing trees with perfect angular resolution and polynomial area
- 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
- A Note on Minimum-Segment Drawings of Planar Graphs
- Trade-Offs in Planar Polyline Drawings
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments
- Pinning balloons with perfect angles and optimal area
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
- Drawing Graphs with Few Arcs
- On topological aspects of orientations
