Timothy M. Chan
Abstract
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3n) expected amortized time, deletions take O(log6n) expected amortized time, and extreme-point queries take O(log2n) worst-case time. This is the first method that guarantees polylogarithmic update and query cost for arbitrary sequences of insertions and deletions, and improves the previous O(nϵ)-time method by Agarwal and Matoušek a decade ago. As a consequence, we obtain similar results for nearest neighbor queries in two dimensions and improved results for numerous fundamental geometric problems (such as levels in three dimensions and dynamic Euclidean minimum spanning trees in the plane).
- Afshani, P., and Chan, T. M. 2009. Optimal halfspace range reporting in three dimensions. In Proceedings of the 20th ACM--SIAM Symposium on Discrete Algorithms. ACM, New York, 180--186. Google Scholar
Digital Library
- Agarwal, P. K., and Matoušek, J. 1995. Dynamic half-space range reporting and its applications. Algorithmica 13, 325--345.Google ScholarCross Ref
- Bentley, J., and Saxe, J. 1980. Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms 1, 301--358.Google ScholarCross Ref
- Brodal, G. S., and Jacob, R. 2002. Dynamic planar convex hull. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 617--626. Google ScholarDigital Library
- Chan, T. M. 1998. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. J. Algorithms 27, 147--166. Google ScholarDigital Library
- Chan, T. M. 2000. Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions. SIAM J. Comput. 30, 561--575. Google ScholarDigital Library
- Chan, T. M. 2001. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM 48, 1--12. Google ScholarDigital Library
- Chan, T. M. 2003. Semi-online maintenance of geometric optima and measures. SIAM J. Comput. 32, 700--716. Google ScholarDigital Library
- Chan, T. M. 2005. Low-dimensional linear programming with violations. SIAM J. Comput. 34, 879--893. Google ScholarDigital Library
- Chazelle, B. 1985. On the convex layers of a planar set. IEEE Trans. Inform. Theory IT-31, 509--517.Google ScholarDigital Library
- Chazelle, B. 2005. Cuttings. In Handbook of Data Structures and Applications, D. P. Mehta and S. Sahni, Eds. CRC Press, 25.1--25.10.Google Scholar
- Clarkson, K. L. 1987. New applications of random sampling in computational geometry. Disc. Comput. Geom. 2, 195--222.Google ScholarDigital Library
- Clarkson, K. L., Mehlhorn, K., and Seidel, R. 1993. Four results on randomized incremental constructions. Comput. Geom. Theory Appl. 3, 185--121. Google ScholarDigital Library
- de Berg, M., van Kreveld, M., Overmars, M., and Schwarzkopf, O. 2000. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany. Google ScholarDigital Library
- Devillers, O., Meiser, S., and Teillaud, M. 1992. Fully dynamic delaunay triangulation in logarithmic expected time per operation. Comput. Geom. Theory Appl. 2, 55--80. Google ScholarDigital Library
- Dobkin, D. P. and Kirkpatrick, D. G. 1983. Fast detection of polyhedral intersection. Theoret. Comput. Sci. 27, 241--253.Google ScholarCross Ref
- Dobkin, D. P., and Suri, S. 1991. Maintenance of geometric extrema. J. ACM 38, 275--298. Google ScholarDigital Library
- Eppstein, D. 1992. Dynamic three-dimensional linear programming. ORSA J. Comput. 4, 360--368.Google ScholarCross Ref
- Eppstein, D. 1995. Dynamic euclidean minimum spanning trees and extrema of binary functions. Disc. Comput. Geom. 13, 111--122.Google ScholarDigital Library
- Eppstein, D. 2000a. Fast hierarchical clustering and other applications of dynamic closest pairs. J. Experimental Algorithmics 5, 1--23. Google ScholarDigital Library
- Eppstein, D. 2000b. Incremental and decremental maintenance of planar width. J. Algorithms 37, 570--577. Google ScholarDigital Library
- Har-Peled, S. 2000. Taking a walk in a planar arrangement. SIAM J. Comput. 30, 1341--1367. Google ScholarDigital Library
- Holm, J., de Lichtenberg, K., and Thorup, M. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48, 723--760. Google ScholarDigital Library
- Matoušek, J. 1990. Construction of &epsis;-nets. Disc. Comput. Geom. 5, 427--448.Google ScholarDigital Library
- Matoušek, J. 1992. Reporting points in halfspaces. Comput. Geom. Theory Appl. 2, 169--186. Google ScholarDigital Library
- Matoušek, J. 1993. Linear optimization queries. J. Algorithms 14, 432--448. Google ScholarDigital Library
- Matoušek, J. 1995. On geometric optimization with few violated constraints. Disc. Comput. Geom. 14, 365--384.Google ScholarDigital Library
- Matoušek, J. and Schwarzkopf, O. 1993. On ray shooting in convex polytopes. Disc. Comput. Geom. 10, 215--232.Google ScholarDigital Library
- Mehlhorn, K. 1984. Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer-Verlag, Heidelberg, Germany. Google ScholarDigital Library
- Mulmuley, K. 1994. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
- Overmars, M. H., and van Leeuwen, J. 1981. Maintenance of configurations in the plane. J. Comput. Sys. Sci. 23, 166--204.Google ScholarCross Ref
- Preparata, F. P. and Shamos, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York. Google ScholarDigital Library
- Ramos, E. 1999. On range reporting, ray shooting, and k-level construction. In Proceedings of the 15th Annual ACM Symposium on Computer Geometry. ACM, New York, 390--399. Google ScholarDigital Library
- Schwarzkopf, O. 1991. Dynamic maintenance of geometric structures made easy. In Proceedings of the 32nd IEEE Symposium on Foundation of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 197--206. Google ScholarDigital Library
- Sharir, M. 1991. On k-sets in arrangements of curves and surfaces. Disc. Comput. Geom. 6, 593--613.Google ScholarDigital Library
- Sharir, M., Smorodinsky, S., and Tardos, G. 2001. An improved bound for k-sets in three dimensions. Disc. Comput. Geom. 26, 195--204.Google ScholarDigital Library
Index Terms
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Recommendations
Three problems about dynamic convex hulls
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryWe present three results related to dynamic convex hulls: A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the convex hull intersecting a query line, with expected query and amortized update ...
Dynamic planar convex hull operations in near-logarithmic amortized time
We give a data structure that allows arbitrary insertions and deletions on a planar point set P and supports basic queries on the convex hull of P, such as membership and tangent-finding. Updates take O(log1+εn) amori tzed time and queries take O (log n ...
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithmWe present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expected amortized time, deletions take O(log6 n) expected amortized time, and ...
Comments