Abstract
We show that the Voronoi diagram of a finite sequence of points in the plane which gives sorted order of the points with respect to two perpendicular directions can be computed in linear time. In contrast, we observe that the problem of computing the Voronoi diagram of a finite sequence of points in the plane which gives the sorted order of the points with respect to a single direction requires Ω(n log n) operations in the algebraic decision tree model. As a corollary from the first result, we show that the bounded Voronoi diagrams of simple n-vertex polygons which can be efficiently cut into the so called monotone histograms can be computed in o(n log n) time.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, L.J. Guibas, J. Saxe and P.W. Shor, A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discrete and Computational Geometry 2 (1987), Springer Verlag.
B. Chazelle, A Theorem on Polygon Cutting with Applications. Proc. 23rd IEEE FOCS Symposium, 1982.
B. Chazelle, Triangulating a Simple Polygon in Linear Time. Proc. 31st IEEE FOCS Symposium, 1990.
H. Edelsbrunner, Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science 10, Springer Verlag, Berlin (1987).
S. Fortune, A Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2(1987), pp. 153–174.
L.J. Guibas and J. Stolfi, Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams. In ACM Trans. Graphics 4 (1985), 74–123.
D.T. Lee and A. Lin, Generalized Delaunay Triangulations for Planar Graphs. In Discrete and Computational Geometry 1 (1986), Springer Verlag, pp. 201–217.
A. Lingas, On Partitioning Polygons. Proc. 1st ACM Symposium on Computational Geometry, Baltimore, 1985.
A. Lingas, Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. In Information Processing Letters 32(1989), pp. 191–198.
F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction. Texts and Monographs in Theoretical Computer Science, Springer Verlag, New York (1985).
C. Wang and L. Schubert, An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. In Proc. 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 223–232, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Djidjev, H., Lingas, A. (1991). On computing the voronoi diagram for restricted planar figures. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028250
Download citation
DOI: https://doi.org/10.1007/BFb0028250
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54343-5
Online ISBN: 978-3-540-47566-8
eBook Packages: Springer Book Archive