Every collinear set in a planar graph is free
DOI10.1007/s00454-019-00167-xzbMath1462.05108arXiv1811.03432OpenAlexW2900296367WikidataQ126338108 ScholiaQ126338108MaRDI QIDQ2022612
Fabrizio Frati, Pat Morin, Daniel Gonçalves, Günter Rote, Vida Dujmović
Publication date: 29 April 2021
Published in: Discrete \& Computational Geometry, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03432
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Cites Work
- Unnamed Item
- Untangling planar graphs from a specified vertex position-Hard cases
- How to draw a planar graph on a grid
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
- Untangling polygons and graphs
- A polynomial bound for untangling geometric planar graphs
- Untangling a planar graph
- Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
- Checking the convexity of polytopes and the planarity of subdivisions
- On embedding an outer-planar graph in a point set
- Untangling a polygon
- On Collinear Sets in Straight-Line Drawings
- Aligned Drawings of Planar Graphs
- Drawing planar graphs with many collinear vertices
- Universal Point Subsets for Planar Graphs
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- Column planarity and partially-simultaneous geometric embedding
- Superpatterns and Universal Point Sets
- How to Draw a Graph
- The Utility of Untangling
This page was built for publication: Every collinear set in a planar graph is free
