Approximate proximity drawings
From MaRDI portal
Publication:1947972
DOI10.1016/j.comgeo.2013.01.001zbMath1267.65025OpenAlexW1991522034WikidataQ62042418 ScholiaQ62042418MaRDI QIDQ1947972
Andreas Spillner, Michael Kaufmann, Giuseppe Liotta, Henk G. Meijer, William S. Evans, Emden R. Gansner
Publication date: 29 April 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.01.001
Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Cites Work
- Witness Gabriel graphs
- Drawing a tree as a minimum spanning tree approximation
- Witness (Delaunay) graphs
- Toughness and Delaunay triangulations
- How to draw a planar graph on a grid
- The strength of weak proximity
- Characterizing proximity trees
- Approximate Proximity Drawings
- A simple method for resolving degeneracies in Delaunay triangulations
- The Approximate Rectangle of Influence Drawability Problem
- On the Area Requirements of Euclidean Minimum Spanning Trees
- Witness Rectangle Graphs