Abstract
Let S be a set of n moving points in the plane. We present a kinetic and dynamic (randomized) data structure for maintaining the convex hull of S. The structure uses O(n) space, and processes an expected number of O(n 2 β s + 2(n)log n) critical events, each in O(log2 n) expected time, including O(n) insertions, deletions, and changes in the flight plans of the points. Here s is the maximum number of times where any specific triple of points can become collinear, β s (q)=λ s (q) / q, and λ s (q) is the maximum length of Davenport-Schinzel sequences of order s on n symbols. Compared with the previous solution of Basch et al.[2], our structure uses simpler certificates, uses roughly the same resources, and is also dynamic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Guibas, L., Hershberger, J., Veach, E.: Maintaining the extent of a moving point set. Discrete Comput. Geom. 26, 353–374 (2001)
Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1–28 (1999)
Chan, T.M.: On levels in arrangements of curves, II: A simple inequality and its consequences. In: Proc. 44th IEEE Sympos. Foundat. Comput. Sci., pp. 544–550 (2003)
Dey, T.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19, 373–382 (1998)
Guibas, L.: Kinetic data structures: a state of the art report. In: Robotics: the Algorithmic Perspective (WAFR 1998), pp. 191–209. A.K. Peters, Natick (1998)
Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Computer Syst. Sci. 23, 166–204 (1981)
Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica 16, 464–497 (1996)
Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alexandron, G., Kaplan, H., Sharir, M. (2005). Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. In: Dehne, F., López-Ortiz, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2005. Lecture Notes in Computer Science, vol 3608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534273_24
Download citation
DOI: https://doi.org/10.1007/11534273_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28101-6
Online ISBN: 978-3-540-31711-1
eBook Packages: Computer ScienceComputer Science (R0)