The strength of weak proximity
From MaRDI portal
Publication:849629
DOI10.1016/j.jda.2005.12.004zbMath1102.65022OpenAlexW1575954839WikidataQ62042590 ScholiaQ62042590MaRDI QIDQ849629
Giuseppe Liotta, S. H. Whitesides, Giuseppe Di Battista
Publication date: 31 October 2006
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.12.004
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (10)
PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Witness Gabriel graphs ⋮ Approximate Proximity Drawings ⋮ Approximate proximity drawings ⋮ Polynomial area bounds for MST embeddings of trees ⋮ On Vertex- and Empty-Ply Proximity Drawings ⋮ Witness (Delaunay) graphs ⋮ Closed rectangle-of-influence drawings for irreducible triangulations ⋮ Witness rectangle graphs ⋮ The approximate rectangle of influence drawability problem
Cites Work
- Unnamed Item
- Unnamed Item
- Area requirement of visibility representations of trees
- The relative neighborhood graph for mixed feature variables
- A unified approach to visibility representations of planar graphs
- The complexity of minimizing wire lengths in VLSI layouts
- Area requirement and symmetry display of planar upward drawings
- Computing a subgraph of the minimum weight triangulation
- The logic engine and the realization problem for nearest neighbor graphs
- The realization problem for Euclidean minimum spanning trees is NP-hard
- Characterizing proximity trees
- Drawing Graphs in the Plane with High Resolution
- On the Angular Resolution of Planar Graphs
- Computing proximity drawings of trees in the 3-dimensional space
- On locally Delaunay geometric graphs
- Algorithms and Data Structures
- The drawability problem for minimum weight triangulations
This page was built for publication: The strength of weak proximity
