Abstract
In this paper we give a new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay triangulations. The new algorithm is more “online” than earlier similar methods, takes expected time O(n log n) and space O(n), and is eminently practical to implement. The analysis of the algorithm is also interesting in its own right and can serve as a model for many similar questions in both two and three dimensions. Finally we demonstrate how this approach for constructing Voronoi diagrams obviates the need for building a separate point-location structure for nearest-neighbor queries.
Preview
Unable to display preview. Download preview PDF.
References
G. Andrews, The Theory of Partitions, Addison-Wesley, 1976. (Encyclopedia of Mathematics and its Applications, Volume 2.)
J. Bentley, B. Weide, and A. Yao, Optimal expected time algorithms for closest point problems, ACM Trans. Math. Soft. 6 (1980), 536–580.
J-D. Boissonnat, and M. Teillaud, A hierarchical representation of objects: the Delaunay tree, Proc. 2nd ACM Symp. on Computational Geometry (1986), 260–268.
P. Chew, The simplest Voronoi diagram algorithm takes linear expected time, manuscript, 1988.
K. Clarkson, Personal communication, 1989.
K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comp. Geom., 4 (1989), 387–421.
B. Delaunay, Sur la sphère vide, Izv. Akad. Nauk SSSR. Otdelenie Matematicheskii i Estestvennyka Nauk, 7 (1934), 793–800.
B. Delaunay, Neue Darstellung der geometrischen Krystallographie, Zeitschr. Krystallographie, 84 (1932), 109–149.
R. Dwyer, Higher dimensional Voronoi diagrams in linear expected time, Proc. 5th ACM Symp. on Computational Geometry, 1989, 326–333.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg 1987.
H. Edelsbrunner, L. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comp. 15 (1986), 371–340.
S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica 2 (1987), 153–174.
S. Fortune, A note on Delaunay diagonal flips, unpublished manuscript.
P. Green and R. Sibson, Computing Dirichlet tesselation in the plane, Comput. J. 21 (1977), 168–173.
L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. on Graphics 4 (1985), 74–123.
D. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comp. 12 (1983), 28–35.
J. Jaromczyk, and G. Swiatek, Degenerate cases do not require more memory, manuscript, 1989.
K. Mehlhorn, S. Meiser and C. Ó'Dúnlaing, On the construction of abstract Voronoi diagrams, manuscript, 1989.
K. Mulmuley, A fast planar partition algorithm, U. of Chicago, Dept. of Comp. Sc., Tech. Rep. 88-107, May 1988.
F. Preparata and M. Shamos, Computational Geometry — An Introduction, Springer-Verlag, Berlin 1985.
F. Preparata and R. Tamassia, Fully dynamic techniques for point location and transitive closure in planar structures, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, 558–567.
R. Seidel, private communication.
G. Voronoi, Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier Mémoire: Sur quelques proprieteés des formes quadratiques positives parfaites, J. reine angew. Math., 133 (1907), 97–178.
G. Voronoi, Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième Mémoire: Recherches sur les parallélloèdres primitifis, J. reine angew. Math., 134 (1908), 167–171.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guibas, L.J., Knuth, D.E., Sharir, M. (1990). Randomized incremental construction of delaunay and Voronoi diagrams. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032048
Download citation
DOI: https://doi.org/10.1007/BFb0032048
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive