Kinetic and dynamic data structures for convex hulls and upper envelopes

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 269-281

  Alexandron, Giora ^a   Kaplan, Haim ^a   Sharir, Micha ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES; SET THEORY;

CONVEX HULL; CRITICAL EVENTS; DAVENPORT-SCHINZEL SEQUENCES; DYNAMIC DATA STRUCTURES;

DATA STRUCTURES;

EID: 26844565483     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_24     Document Type: Conference Paper

References (8)

1. P. K. Agarwal, L. Guibas, J. Hershberger, and E. Veach, Maintaining the extent of a moving point set, Discrete Comput. Geom. 26 (2001), 353-374.
2. J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, J. Algorithms 31 (1999), 1-28.
3. T.M. Chan, On levels in arrangements of curves, II: A simple inequality and its consequences, Proc. 44th IEEE Sympos. Foundat. Comput. Sci., 2003, 544-550.
4. T. Dey, Improved bounds for planar k-sets and related problems, Discrete Comput. Geom. 19 (1998), 373-382.
5. L. Guibas, Kinetic data structures: a state of the art report. Robotics: the Algorithmic Perspective (WAFR 1998), 191-209, A.K. Peters, Natick, MA, 1998.
6. M. H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Computer Syst. Sci. 23 (1981), 166-204.
7. R. Seidel and C. R. Aragon, Randomized search trees, Algorithmica 16 (1996), 464-497.
8. M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.