Abstract
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point q whether q ∈ S. We study trade-offs between the worst-case query time in a kinetic dictionary and the total cost of maintaining it during the motions of the points.
Part of this research was done during a visit to Stanford University.
This is a preview of subscription content, log in via an institution to check access.
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.: Range searching. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Duiscrete and Computational Geometry, pp. 575–598. CRC Press, Boca Raton (1997)
Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. In: Proc. Annu. ACM Sympos. Principles Database Syst., pp. 175–186 (2000)
Agarwal, P.K., Basch, J., de Berg, M., Guibas, L.J., Hershberger, J.: Lower bounds for kinetic planar subdivisions. Discrete Comput. Geom. 24, 721–733 (2000)
Agarwal, P.K., Har-Peled, S.: Maintaining approximate extent measures of moving points. In: Proc. 12th ACM-SIAM Symp. Discrete Algorithms (2001)
Agarwal, P.K., Sharir, M.: Pseudoline arrangements: duality, algorithms, and applications. In: Proc. 13th ACM-SIAM Symp. Discrete Algorithms (2002)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2001)
Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Alg. 31, 1–28 (1999)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)
Guibas, L.J.: Kinetic data structures—a state-of-the-art report. In: Proc. 3rd Workshop Algorithmic Found. Robot., pp. 191–209 (1998)
Kirkpatrick, D., Speckmann, B.: Kinetic maintenance of context-sensitive hierarchical representations of disjoint simple polygons. In: Proc. 18th Annu. ACM Symp. Comput. Geom., pp. 179–188 (2002)
Matoušek, J.: Efficient partition trees. Discrete Comput. Geom. 8, 315–334 (1992)
Pfoser, D., Jensen, C.J., Theodoridis, Y.: Novel approaches to the indexing of moving object trajectories. In: Proc. 26th Int. Conf. Very Large Databases, pp. 395–406 (2000)
Šaltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proc. ACM-SIGMOD Int. Conf. on Management of Data, pp. 331–342 (2000)
Wolfson, O., Sistla, A.P., Chamberlain, S., Yesha, Y.: Updating and querying databases that track mobile units. Distributed and Parallel Databses, 257–287 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Berg, M. (2003). Kinetic Dictionaries: How to Shoot a Moving Target. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive