On 2-site Voronoi diagrams under geometric distance functions
From MaRDI portal
Publication:2434572
DOI10.1007/S11390-013-1328-2zbMATH Open1280.68276arXiv1105.4130OpenAlexW2042999093MaRDI QIDQ2434572FDOQ2434572
Authors: Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina 
Publication date: 6 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Abstract: We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, and analyze the structure and complexity of the nearest- and furthest-neighbor Voronoi diagrams of a point set with respect to these distance functions.
Full work available at URL: https://arxiv.org/abs/1105.4130
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Crossing-Free Subgraphs
- On a Problem of Heilbronn
- Voronoi diagrams with respect to criteria on vision information
- Title not available (Why is that?)
- On the Triangle-Perimeter Two-Site Voronoi Diagram
Cited In (7)
- On Clustering Induced Voronoi Diagrams
- On the Triangle-Perimeter Two-Site Voronoi Diagram
- The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
- 2-point site Voronoi diagrams
- Title not available (Why is that?)
- Round-trip Voronoi diagrams and doubling density in geographic networks
- Title not available (Why is that?)
This page was built for publication: On 2-site Voronoi diagrams under geometric distance functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434572)
