Line and plane cover numbers revisited
From MaRDI portal
Publication:2206873
DOI10.1007/978-3-030-35802-0_31OpenAlexW2991639878MaRDI QIDQ2206873
Alexander Wolff, Henk G. Meijer, Stefan Felsner, Therese C. Biedl
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.07647
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
The Complexity of Drawing Graphs on Few Lines and Few Planes ⋮ 4-connected triangulations on few lines ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines
Cites Work
- Track layouts, layered path decompositions, and leveled planarity
- 4-connected triangulations on few lines
- Drawings of planar graphs with few slopes and segments
- The complexity of drawing graphs on few lines and few planes
- Drawing Graphs on Few Lines and Few Planes
- Laying Out Graphs Using Queues
- Forbidden Configurations in Discrete Geometry
- Drawing Planar Graphs with Few Geometric Primitives
- Experimental Analysis of the Accessibility of Drawings with Few Segments
- Cubic Planar Graphs that cannot be Drawn on few Lines
- Drawing Graphs with Few Arcs
- Unnamed Item
This page was built for publication: Line and plane cover numbers revisited
