Drawing Planar Graphs with Many Collinear Vertices
From MaRDI portal
Publication:2961512
DOI10.1007/978-3-319-50106-2_13zbMath1417.68155arXiv1606.03890OpenAlexW2442922754MaRDI QIDQ2961512
Tamara Mchedlidze, Fabrizio Frati, Vincenzo Roselli, Giordano Da Lozzo, Vida Dujmović
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03890
Related Items (4)
Non-aligned Drawings of Planar Graphs ⋮ Drawing Planar Graphs with Many Collinear Vertices ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Aligned Drawings of Planar Graphs
Cites Work
- Untangling planar graphs from a specified vertex position-Hard cases
- 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
- Long cycles in 3-connected graphs
- On embedding an outer-planar graph in a point set
- Untangling a polygon
- Straight-line drawing algorithms for hierarchical graphs and clustered graphs
- Shortness exponents of families of graphs
- Column Planarity and Partial Simultaneous Geometric Embedding
- Drawing Planar Graphs with Many Collinear Vertices
- On Collinear Sets in Straight-Line Drawings
- Towards an implementation of the 3D visibility skeleton
- Universal Point Subsets for Planar Graphs
- Upper Bound Constructions for Untangling Planar Geometric Graphs
- How to Draw a Graph
- The Utility of Untangling
This page was built for publication: Drawing Planar Graphs with Many Collinear Vertices
