Kinetic medians and kd-trees

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

Volumn 2461, Issue , 2002, Pages 5-17

  Agarwal, Pankaj K ^a   Gao, Jie ^b   Guibas, Leonidas J ^b  

^a Duke University   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOUNDING BOX; CONSTANT FACTORS; KINETIC DATA STRUCTURE; MEDIAN ALGORITHMS; ON-LINE FASHION; QUADRATIC NUMBER; SMOOTH TRAJECTORIES; UPDATE COSTS;

TREES (MATHEMATICS);

EID: 84867981930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_5     Document Type: Conference Paper

References (25)

1. P. K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. In Proc. Annu. ACM Sympos. Principles Database Syst., 2000. 175–186. 5, 7
2. P. K. Agarwal, L. Arge, and J. Vahrenhold. Time responsive external data structures for moving points. In Workshop on Algorithms and Data Structures, pages 50–61, 2001. 10
3. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223of Contemporary Mathematics, pages 1–56. American Mathematical Society, Providence, RI, 1999. 6, 7
4. P. K. Agarwal and M. Sharir. Arrangements and their applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49–119. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000. 6
5. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. J. Alg., 31(1):1–28, 1999. 6, 8 16 Pankaj K. Agarwal et al.
6. J. Basch, L. J. Guibas, and G. D. Ramkumar. Reporting red-blue intersections between two sets of connected line segments. InProc. 4th Annu. European Sympos.Algorithms, volume 1136 of Lecture Notes Comput. Sci., pages 302–319. Springer-Verlag, 1996. 6
7. J. L. Bentley. Multidimensional binary search trees used for associative searching.Communications of the ACM, 18(9):509–517, 1975. 6
8. R. Cole, J. Salowe, W. Steiger, and E. Szemerédi. An optimal-time algorithm for slope selection. SIAM J. Comput., 18(4):792–810, 1989. 9
9. W. Cunto, G. Lau, and P. Flajolet. Analysis of kdt-trees: kd-trees improved by local reorganisations. Workshop on Algorithms and Data Structures (WADS’89),382:24–38, 1989. 7
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997. 6
11. T. K. Dey. Improved bounds on planar k-sets and k-levels. In IEEE Symposiumon Foundations of Computer Science, pages 165–161, 1997. 6
12. H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., 15:271–284, 1986. 6
13. L. J. Guibas. Kinetic data structures—a state of the art report. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Proc. Workshop Algorithmic Found. Robot., pages 191–209. A. K. Peters, Wellesley, MA, 1998. 6
14. R. H. Guting, M. H. Böohlen, M. Erwig, C. S. Jensen, N. A. Lorentzos, M. Schneider, and M. Vazirgiannis. A foundation for representing and querying moving objects. ACM Trans. Database Systems, 25(1):1–42, 2000. 5
15. G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In Proc. Annu. ACM Sympos. Principles Database Syst., pages 261–272, 1999. 5, 7
16. J. Matousek. Construction of _-nets. Discrete Comput. Geom., 5:427–448, 1990. 6, 8
17. J. Nievergelt and P. Widmayer. Spatial data structures: Concepts and design choices. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 725–764. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000. 6
18. M. H. Overmars. The Design of Dynamic Data Structures, volume 156 of Lecture Notes Comput. Sci. Springer-Verlag, Heidelberg, West Germany, 1983. 7, 12
19. D. Pfoser, C. J. Jensen, and Y. Theodoridis. Novel approaches to the indexing of moving object trajectories. In Proc. 26th Intl. Conf. Very Large Databases, pages 395–406, 2000. 5, 7
20. C. M. Procopiuc, P. K. Agarwal, and S. Har-Peled. Star-tree: An efficent selfadjusting index for moving points. In Proc. 4th Workshop on Algorithm Engineering and Experiments, 2002. 7
21. A. P. Sistla and O. Wolfson. Temporal conditions and integrity constraints in active database systems. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, pages 269–280, 1995. 5
22. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and querying moving objects. In Proc. Intl Conf. Data Engineering, pages 422–432, 1997. 5
23. G. Toth. Point sets with many k-sets. Discrete & Computational Geometry, 26(2):187–194, 2001. 6
24. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In Proc. ACM SIGMOD International Conference on Management of Data, pages 331–342, 2000. 5, 7 Kinetic Medians and kd-Trees 17
25. O. Wolfson, A. P. Sistla, S. Chamberlain, and Y. Yesha. Updating and queryingdatabases that track mobile units. Distributed and Parallel Databases, pages 257–287, 1999. 5, 7