Approximate Proximity Drawings
From MaRDI portal
Publication:3223952
DOI10.1007/978-3-642-25878-7_17zbMath1311.68117OpenAlexW2119099525WikidataQ62042444 ScholiaQ62042444MaRDI QIDQ3223952
Emden R. Gansner, Giuseppe Liotta, Michael Kaufmann, Andreas Spillner, Henk G. Meijer, William S. Evans
Publication date: 9 March 2012
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_17
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Witness Gabriel graphs ⋮ Convex hulls under uncertainty ⋮ Shape-faithful graph drawings ⋮ Approximate proximity drawings ⋮ Weak Unit Disk and Interval Representation of Graphs
Cites Work
- Witness (Delaunay) graphs
- How to draw a planar graph on a grid
- The strength of weak proximity
- Realizability of Delaunay triangulations
- Characterizing proximity trees
- Drawing a Tree as a Minimum Spanning Tree Approximation
- On the Area Requirements of Euclidean Minimum Spanning Trees
- Witness Rectangle Graphs
This page was built for publication: Approximate Proximity Drawings
