On Vertex- and Empty-Ply Proximity Drawings
From MaRDI portal
Publication:4625098
DOI10.1007/978-3-319-73915-1_3zbMath1503.68202arXiv1708.09233MaRDI QIDQ4625098
Michael Kaufmann, Jaroslav Hančl Jr., Jan Kratochvíl, Steven Chaplick, Pavel Valtr, Felice De Luca, Stephen G. Kobourov, Patrizio Angelini, Niklas Heinsohn, Jiří Fiala
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09233
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
An Experimental Study on the Ply Number of Straight-line Drawings, On Vertex- and Empty-Ply Proximity Drawings
Cites Work
- Unnamed Item
- Unnamed Item
- The strength of weak proximity
- The relative neighbourhood graph of a finite planar set
- Unit disk graph recognition is NP-hard
- Low Ply Drawings of Trees
- An Experimental Study on the Ply Number of Straight-Line Drawings
- Drawing Graphs in the Plane with High Resolution
- On the Angular Resolution of Planar Graphs
- On Vertex- and Empty-Ply Proximity Drawings
- An Interactive Tool to Explore and Improve the Ply Number of Drawings
- Progress on Partial Edge Drawings