Kinetic Dictionaries: How to Shoot a Moving Target

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 172-183

  De Berg, Mark ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

MOVING TARGETS; QUERY POINTS; QUERY TIME; REAL LINE; TRADE OFF;

KINETICS;

EID: 0142214935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_18     Document Type: Article

References (14)

1. P.K. Agarwal. Range searching. In: J.E. Goodman and J. O'Rourke (eds.), Handbook of Duiscrete and Computational Geometry, CRC Press, pages 575-598, 1997.
2. P.K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. In Proc. Annu. ACM Sympos. Principles Database Syst., pages 175-186, 2000.
3. P.K. Agarwal, J. Basch, M. de Berg, L.J. Guibas, and J. Hershberger. Lower bounds for kinetic planar subdivisions. Discrete Comput. Geom. 24:721-733 (2000).
4. P.K. Agarwal and S. Har-Peled. Maintaining approximate extent measures of moving points. In Proc. 12th ACM-SIAM Symp. Discrete Algorithms, 2001.
5. P.K. Agarwal ans M. Sharir. Pseudoline arrangements: duality, algorithms, and applications. In Proc. 13th ACM-SIAM Symp. Discrete Algorithms, 2002.
6. J. Bang-Jensen and G. Gutin. Digraphs: Theory, Algorithms and Applications. Springer-Verlag, 2001.
7. J. Basch, L.J. Guibas, and J. Hershberger. Data structures for mobile data. J. Alg. 31:1-28 (1999).
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, 1997.
9. L.J. Guibas. Kinetic data structures - a state-of-the-art report. In Proc. 3rd Workshop Algorithmic Found. Robot., pages 191-209, 1998.
10. D. Kirkpatrick and B. Speckmann. Kinetic maintenance of context-sensitive hierarchical representations of disjoint simple polygons. In Proc. 18th Annu. ACM Symp. Comput. Geom., pages 179-188, 2002.
11. J. Matousek. Efficient partition trees. Discrete Comput. Geom. 8:315-334 (1992).
12. D. Pfoser, C.J. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. In Proc. 26th Int. Conf. Very Large Databases, pages 395-406, 2000.
13. S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez. Indexing the positions of continuously moving objects. In Proc. ACM-SIGMOD Int. Conf. on Management of Data, pages 331-342, 2000.
14. O. Wolfson, A.P. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed and Parallel Databses, pages 257-287, 1999.