Maintaining approximate extent measures of moving points

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 148-157

  Agarwal, Pankaj K ^a   Hal Peled, Sariel ^b  

^a Duke University   (United States)

^b Digital Computer Laboratory   (United States)

Author keywords

Algorithms; Measurement; Theory; Verification

Indexed keywords

EID: 0001795426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Pankaj K. Agarwal, Jeff Erickson , Leonidas J. Guibas, Kinetic binary space partitions for intersecting segments and disjoint triangles, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.107-116, January 25-27, 1998, San Francisco, California, United States
2. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach, Maintaining the Extent of a Moving Point Set, Proceedings of the 5th International Workshop on Algorithms and Data Structures, p.31-44, August 06-08, 1997
3. P. K. AGARWAL AND J. MATOUSEK, On range searching with semialgebraie sets, Discrete Comput. Geom., 11 (1994), pp. 393-418.
4. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, Finding minimal convex nested polygons, Information and Computation, v.83 n.1, p.98-110, Oct. 1989 [doi〉10.1016/0890-5401(89)90049-7]
5. M. J. ATALLAH, Some dynamic computational geometry problems, Comput. Math. Appl., 11 (1985), pp. 1171-1181.
6. Gill Barequet, Sariel Har-Peled, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.82-91, January 17-19, 1999, Baltimore, Maryland, United States
7. Julien Basch , Leonidas J. Guibas , John Hershberger, Data structures for mobile data, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.747-756, January 05-07, 1997, New Orleans, Louisiana, United States
8. E. BRONSHTEYN AND L. IVANOV, The approximation of convex sets by polyhedra, Siberian Math. J., 16 (1976), pp. 852-853.
9. Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Schwarzkopf, Computational geometry: algorithms and applications, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
10. R. M. DUDLEY, Metric entropy of some classes of sets with differentiable boundaries, J. Approx. Theory, 10 (1974), pp. 227-236.
11. Leonidas J. Guibas, Kinetic data structures: a state of the art report, Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective, p.191-209, August 1998, Houston, Texas, United States
12. M. H. OVERMARS AND J. VAN LEEUWEN, Maintenance of configurations in the plane, J. Comput. Syst. Sci., 23 (1981), pp. 166-204.
13. Simonas Šaltenis, Christian S. Jensen, Scott T. Leutenegger, Mario A. Lopez, Indexing the positions of continuously moving objects, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.331-342, May 15-18, 2000, Dallas, Texas, United States
14. Micha Sharir, Pankaj K. Agarwal, Davenport-Schinzel sequences and their geometric applications, Cambridge University Press, New York, NY, 1996
15. A C Yao, F F Yao, A general approach to d-dimensional geometric queries, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.163-168, May 06-08, 1985, Providence, Rhode Island, United States [doi〉10.1145/22145.22163]