The anchored Voronoi diagram

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a set S of n points in the plane and a fixed point o, we introduce the Voronoi diagram of S anchored at o. It will be defined as an abstract Voronoi diagram that uses as bisectors the following curves. For each pair of points p, q in S, the bisecting curve between p and q is the locus of points x in the plane such that the line segment ox is equidistant to both p and q. We show that those bisectors have nice properties and, therefore, this new structure can be computed in O(n log n) time and O(n) space both for nearest-site and furthest-site versions. Finally, we show how to use these structures for solving several optimization problems. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Díaz-Báñez, J. M., Gómez, F., & Ventura, I. (2004). The anchored Voronoi diagram. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 207–216. https://doi.org/10.1007/978-3-540-24767-8_22

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