Witness (Delaunay) graphs
From MaRDI portal
Publication:551502
DOI10.1016/j.comgeo.2011.01.001zbMath1232.05190arXiv1008.1053OpenAlexW1993789161MaRDI QIDQ551502
Muriel Dulieu, Boris Aronov, Ferran Hurtado
Publication date: 20 July 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1053
Related Items
PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Witness Gabriel graphs ⋮ Carathéodory's theorem in depth ⋮ Approximate Proximity Drawings ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Approximate proximity drawings ⋮ Hitting and Piercing Rectangles Induced by a Point Set ⋮ Mutual witness proximity graphs ⋮ Witness rectangle graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for realizing a Delaunay triangulation
- Fast detection of polyhedral intersection
- Toughness and Delaunay triangulations
- The strength of weak proximity
- Realizability of Delaunay triangulations
- The relative neighborhood graph for mixed feature variables
- Voronoi diagrams and arrangements
- On empty triangles determined by points in the plane
- Transitions in geometric minimum spanning trees
- A short proof of Chvatal's Watchman Theorem
- Modular decomposition and transitive orientation
- Motion planning for a convex polygon in a polygonal environment
- Simpler proof of a realizability theorem on Delaunay triangulations
- Graph-theoretical conditions for inscribability and Delaunay realizability
- The rectangle of influence drawability problem
- Voronoi drawings of trees
- Competitive facility location: the Voronoi game
- Trees that are sphere-of-influence graphs
- Characterizing proximity trees
- Computing the intersection-depth to polyhedra
- Covering the convex quadrilaterals of point sets
- Efficient algorithms for bichromatic separability
- A linear algorithm for determining the separation of convex polyhedra
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- A general approach to dominance in the plane
- Graph Classes: A Survey
- Witness Rectangle Graphs
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- Partially Ordered Sets
- Discrete and Computational Geometry
