Characterizing proximity trees
From MaRDI portal
Publication:1920422
DOI10.1007/BF02086609zbMath0855.68068OpenAlexW2050602252MaRDI QIDQ1920422
William J. Lenhart, Giuseppe Liotta, Patrick Bosc
Publication date: 14 January 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02086609
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Proximity drawings in polynomial area and volume, Computing proximity drawings of trees in the 3-dimensional space, PROXIMITY DRAWINGS OF HIGH-DEGREE TREES, The strength of weak proximity, The realization problem for Euclidean minimum spanning trees is NP-hard, The rectangle of influence drawability problem, On the area requirements of Euclidean minimum spanning trees, Approximate Proximity Drawings, Shape-faithful graph drawings, Approximate proximity drawings, Polynomial area bounds for MST embeddings of trees, Witness (Delaunay) graphs, The drawability problem for minimum weight triangulations, Computing β-Drawings of 2-Outerplane Graphs in Linear Time, Empty region graphs, On embedding an outer-planar graph in a point set, The approximate rectangle of influence drawability problem, Voronoi drawings of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The relative neighbourhood graph of a finite planar set
- Transitions in geometric minimum spanning trees
- Algorithms for drawing graphs: An annotated bibliography
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Trees that are sphere-of-influence graphs
- On the shape of a set of points in the plane
- Some properties of the planar Euclidean relative neighbourhood graph
- Angles of planar triangular graphs
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
