Abstract
In this paper, we consider the dynamic Voronoi diagram problem. In this problem, a given set of planar points are moving and our objective is to find the Voronoi diagram of these moving points at any time t. A preprocessing algorithm and a query processing algorithm are presented in this paper. Assume that the points are in k-motion, and it takes O(k) time to find the roots of a polynomial with degree O(k). The preprocessing algorithm uses \(O(k^2 n^3 logn\cdot2^{O(\alpha (n)^{5k + 1} )} )\) time to process moving functions of given points, and uses \(O(k^2 n^3 \cdot2^{O(\alpha (n)^{5k + 1} )} )\) space to store the preprocessing result where α(n) is the functional inverse of Ackermann's function. The query processing algorithm is designed to report the Voronoi diagram of these points for a query time t. It takes O(n) time which is optimal.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Agarwal, M. Sharir, and P. Shor, "Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences," Technical Report 332. Computer Science Department, New York University, New York, 1987.
M. J. Atallah, "Dynamic computational geometry," in Proceeding of 24th IEEE Annual Symposium on Foundations of Computer Science, Nov. 1983, pp. 92–99.
J. L. Bently, B. Weide and A. C. Yao, "Optimal expected time algorithms for closest-point problems," ACM Transactions on Mathematical Software, Vol. 6, 1980, pp. 563–580.
J. L. Bentley and D. Wood, "An optimal worst-case algorithm for reporting intersections of rectangles," IEEE Transactions on Computers, Vol. C-29, July 1980, pp. 571–577.
B. Chazelle, "Filtering search: a new approach to query-answering," SIAM Journal on Computing, Vol. 15. No. 4, Aug. 1986, pp.703–724.
H. Edelsbrunner, "A time-and space-optimal solution for the planar all-intersecting-rectangles problem," Technical Report 50, IIG Technische University Graz, Austria, April 1980.
S. Hart and M. Sharir, "Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes," Combinatorica, No. 6, 1986, pp.151–177.
D. G. Kirkpatrick, "Efficient computation of continuous skeletons," in Proceeding of 20th IEEE Symposium on Fundation of Computer Science, October 1979, pp. 18–27
D. T. Lee, "Two dimensional Voronoi diagrams in the L p-metric," Journal of Association on Computing Machinery, October 1980, pp. 604–618.
E. M. McCreight, "Efficient algorithms for enumerating intersecting intervals and rectangles," Technical Report, Xerox PARC, CLS-80-9, 1980.
E. M. McCreight, "Priority search trees," SIAM Journal on Computing, Vol. 14, 1985, pp. 257–276.
F. P. Preparata and M. I. Shamos, Computational Geometry, New York: Springer-Verlag, 1985.
C. A. Rogers, "Packing and covering," Combridge University Press, Cambridge, England, 1964.
M. I. Shamos and D. Hoey, "Closest-point problems," in Proceeding of 16th IEEE Symposium on Foundation of Computer Science, October 1975, pp. 151–162.
M. I. Shamos, "Computational geometry," Ph.D. Thesis, Department of Computer science, Yale University, 1978.
M. Sharir, "Almost linear upper bounds on the length of general Davenport-Schinzel sequences," Combinatorica, No. 7, 1987, pp.131–143.
G. Voronoi, "Nouvelles applications des parametres continus a la theorie des formes quadratiques. Deuxieme Memorie: Recherches sur les paralleloedres primitifs," Journal of reine angew. Math., No. 134, 1908, pp. 198–287.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, JJ., Lee, R.C.T. (1990). Voronoi diagrams of moving points in the plane. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_49
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive