Abstract
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.
Cite
CITATION STYLE
APA
Barequet, G., Dickerson, M. T., & Scotdrysdale, R. L. (1999). 2-point site voronoi diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1663, pp. 219–230). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free