2-Point site Voronoi diagrams

24Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we define a new type of a planar distance function from a point to a pair of points. We focus on a few such distance functions, analyze the structure and complexity of the corresponding nearest- and furthest-neighbor Voronoi diagrams (in which every region is defined by a pair of point sites), and show how to compute the diagrams efficiently. © 2002 Elsevier Science B.V.

Cite

CITATION STYLE

APA

Barequet, G., Dickerson, M. T., & Scot Drysdale, R. L. (2002). 2-Point site Voronoi diagrams. Discrete Applied Mathematics, 122(1–3), 37–54. https://doi.org/10.1016/S0166-218X(01)00320-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free