1994 | ReviewPaper | Buchkapitel
Hamiltonian abstract Voronoi diagrams in linear time
verfasst von : Rolf Klein, Andrzej Lingas
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.