2-point site Voronoi diagrams
From MaRDI portal
Publication:1613413
DOI10.1016/S0166-218X(01)00320-1zbMath1066.68137OpenAlexW2021565542MaRDI QIDQ1613413
Matthew T. Dickerson, Robert L. Scot Drysdale, Gill Barequet
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00320-1
Related Items (7)
Farthest line segment Voronoi diagrams ⋮ An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points ⋮ Minimum dilation stars ⋮ All-maximum and all-minimum problems under some measures ⋮ Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks ⋮ On Clustering Induced Voronoi Diagrams ⋮ Influence-based Voronoi diagrams of clusters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing convolutions by reciprocal search
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Generalization of Voronoi Diagrams in the Plane
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Crossing-Free Subgraphs
- On the Zone Theorem for Hyperplane Arrangements
This page was built for publication: 2-point site Voronoi diagrams
