Approximate proximity drawings

DOI10.1007/978-3-642-25878-7_17MaRDI QIDQ3223952zbMATH OpenOpenAlexWikidataFDO

Authors Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Andreas Spillner, W. Evans, Henk Meijer

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate proximity drawings
• The strength of weak proximity
• Proximity drawings in polynomial area and volume
• The approximate rectangle of influence drawability problem
• On vertex- and empty-ply proximity drawings

Cites work

• Characterizing proximity trees
• Drawing a tree as a minimum spanning tree approximation
• How to draw a planar graph on a grid
• On the area requirements of Euclidean minimum spanning trees
• Realizability of Delaunay triangulations
• The strength of weak proximity
• Witness (Delaunay) graphs
• Witness rectangle graphs

Cited in

(8)

• Empty region graphs
• Proximity drawings in polynomial area and volume
• Approximate proximity drawings
• The approximate rectangle of influence drawability problem
• Weak unit disk and interval representation of graphs
• Witness Gabriel graphs
• On vertex- and empty-ply proximity drawings
• Shape-faithful graph drawings

This page was built for publication: Approximate proximity drawings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223952)