Kinetic sorting and kinetic convex hulls

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 190-197

  Abam, Mohammad Ali ^a   Berg De, Mark ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Kinetic convex hulls; Kinetic data structures; Kinetic sorting; Lower bounds

Indexed keywords

KINETIC CONVEX HULLS; KINETIC DATA STRUCTURES; KINETIC SORTING; LOWER BOUNDS;

COSTS; DATA STRUCTURES; KINETIC THEORY; POLYNOMIALS;

PROBLEM SOLVING;

EID: 33244454750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064122     Document Type: Conference Paper

References (20)

1. P.K. Agarwal, L. Arge, and J. Erickson. Indexing moving points. In Proc. ACM Sympos. Principles Database Syst., pages 175-186, 2000.
2. P.K. Agarwal, L. Arge, J. Erickson, and H. Yu. Efficient tradeoff schemes in data structures for querying moving objects. In Proc. 12th European Sympos. on Algorithms, pages 4-15, 2004.
3. P.K. Agarwal, L. Arge, and J. Vahrenhold. Time responsive external data structures for moving points. In Proc. 7th Workshop on Algorithms and Data Structures, pages 50-61, 2001.
4. 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.
5. P.K. Agarwal, J. Gao, and L.J. Guibas. Kinetic medians and kd-trees. In Proc. 10th European Sympos. on Algorithms, pages 5-16, 2002.
6. P.K. Agarwal, L.J. Guibas, J. Hershbėrger, and E. Veach. Maintaining the extent of a moving point set. Discrete Comput. Geom., 26:353-374, 2001.
7. P.K. Agarwal and S. Har-Peled. Maintaining approximate extent measures of moving points, pages 148-157, 2001.
8. J. Basch, L.J. Guibas, and J. Hershberger. Data structures for mobile data. J. Algorithms, 31:1-28, 1999.
9. M. de Berg. Kinetic dictionaries: How to shoot a moving target. In Proc. 11th European Sympos. on Algorithms, pages 172-183, 2003.
10. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 1997.
11. L.J. Guibas. Kinetic data structure: a state of art report. In Proc. 3rd Workshop Algorithmic Found. Robot., pages 191-209, 1998.
12. L.J. Guibas, J. Hershberger, S. Suri, and L. Zhang. Kinetic connectivity for unit disks. Discrete Comput. Geom., 25:591-610, 2001.
13. J. Hershberger and S. Suri. Kinetic connectivity of rectangles. In Proc. 15th ACM Sympos. Comput. Geom., pages 237-246, 1999.
14. D. Kirkpatrick and B. Speckmann. Kinetic maintenance of context-sensitive hierarchical representations of disjoint simple polygons. In Proc. 18th ACM Sympos. Comput. Geom., pages 179-188, 2002.
15. G. Kollios, D. Gunopulos, and V. Tsotras. Nearest neighbor queries in a mobile environment. In Proc. Intl. Workshop on Spatiotemporal Database Managment, pages 119-134, 1999.
16. G. Kollios, D. Gunopulos, and V. Tsotras. On indexing mobile objects. In Proc. A CM Sympos. Principles Database Syst., pages 261-272, 1999.
17. J. Matouaek. Reporting points in halfspaces. Computational Geometry: Theory and Apllication, 2:169-186, 1992.
18. J. Matouaek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10:215-232, 1993.
19. S. Saltenis, C. Jensen, S. Leutenegger, and M. Lopez. Indexing the postion of continuously moving objects. In Proc. SIGMOD Intl. Conf. Managment of Data, pages 331-342, 2000.
20. E.W. Weinstein. CRC Concise Encyclopedia of Mathematics. CRC Press, 1999.