A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1196-1202

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; QUERY LANGUAGES; SET THEORY; TREES (MATHEMATICS);

AMORTIZED TIME; GEOMETRIC PROBLEMS; POLYLOGARITHMIC; RANDOMIZED DATA;

DATA STRUCTURES;

EID: 33244459166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109689     Document Type: Conference Paper

References (33)

1. P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Algorithmica, 13:325-345, 1995.
2. J. Bentley and J. Saxe. Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms, 1:301-358, 1980.
3. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2000.
4. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proc. 43rd IEEE Sympos. Found. Comput. Sci., pages 617-626, 2002.
5. T. M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. J. Algorithms, 27:147-166, 1998.
6. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM, 48:1-12, 2001.
7. T. M. Chan. Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions. SIAM J. Comput., 30:561-575, 2001.
8. T. M. Chan. Low-dimensional linear programming with violations. SIAM J. Comput., 34:879-893, 2005.
9. T. M. Chan. Semi-online maintenance of geometric optima and measures. SIAM J. Comput., 32:700-716, 2003.
10. B. Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31:509-517, 1985.
11. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2:195-222, 1987.
12. K. L. Clarkson, K. Mehlhorn, and R. Seidel. Four results on randomized incremental constructions. Comput. Geom. Theory Appl., 3:185-121, 1993.
13. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
14. O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Comput. Geom. Theory Appl., 2:55-80, 1992.
15. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27:241-253, 1983.
16. D. P. Dobkin and S. Suri. Maintenance of geometric extrema. J. ACM, 38:275-298, 1991.
17. D. Eppstein. Dynamic three-dimensional linear programming. ORSA J. Comput., 4:360-368, 1992.
18. D. Eppstein. Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discrete Comput. Geom., 13:111-122, 1995.
19. D. Eppstein. Fast hierarchical clustering and other applications of dynamic closest pairs. J. Experimental Algorithmes, 5:1-23, 2000.
20. D. Eppstein. Incremental and decremental maintenance of planar width. J. Algorithms, 37:570-577, 2000.
21. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, 48:723-760, 2001.
22. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2:169-186, 1992.
23. J. Matoušek. Linear optimization queries. J. Algorithms, 14:432-448, 1993.
24. Also with O. Schwarzkopf in Proc. 8th ACM Sympos. Comput. Geom., pages 16-25, 1992.
25. J. Matoušek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365-384, 1995.
26. J. Matoušek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10:215-232, 1993.
27. K. Mehlhorn. Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer-Verlag, Heidelberg, 1984.
28. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1994.
29. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Sys. Sci., 23:166-204, 1981.
30. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
31. E. Ramos. On range reporting, ray shooting, and k-level construction. In Proc. 15th ACM Sympos. Comput. Geom., pages 390-399, 1999.
32. O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. In Proc. 32nd IEEE Sympos. Found. Comput. Sci., pages 197-206, 1991.
33. M. Sharir, S. Smorodinsky, and G. Tardos. An improved bound for k-sets in three dimensions. Discrete Comput. Geom., 26:195-204, 2001.