Computational geometry: an introduction
Computational geometry: an introduction
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
On the zone theorem for hyperplane arrangements
SIAM Journal on Computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper we investigate a new type of Voronoi diagrams in which every region is defined by a pair of point sites and some distance function from a point to two points. We analyze the complexity of the respective nearest- and furthest-neighbor diagrams of several such distance functions, and show how to compute the diagrams efficiently.