Hamiltonian abstract voronoi diagrams in linear time

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

Abstract

Let V(S) be an abstract Voronoi diagram, and let H be an unbounded simple curve that visits each of its regions exactly once. Suppose that each bisector B(p,q), where p and q are in S, intersects H only once. We show that such a “Hamiltonian” diagram V(S) can be constructed in linear time, given the order of Voronoi regions of V(S) along H. This result generalizes the linear time algorithm for the Voronoi diagram of the vertices of a convex polygon. We also provide, for any δ > log60/29 2, an O(nδ)-time parallelization of the construction of the V(S) optimal in the time-processor product sense.

Cite

CITATION STYLE

APA

Klein, R., & Lingas, A. (1994). Hamiltonian abstract voronoi diagrams in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 11–19). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_161

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