Dynamic planar convex hull operations in near-logarithmic amortized time

Journal of the ACM

Volumn 48, Issue 1, 2001, Pages 1-12

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational geometry; Convex hulls; Dynamic data structures

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MAINTENANCE; OPTIMIZATION; SET THEORY; TREES (MATHEMATICS);

AMORTIZED TIME; BOUNDS; CONVEX HULLS; DYNAMIC DATA STRUCTURES;

COMPUTATIONAL GEOMETRY;

EID: 0344845523     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/363647.363652     Document Type: Article

References (40)

1. AGARWAL, P. K., DE BERG, M., MATOUŠEK, J., AND SCHWARZKOPF, O. 1998. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput. 27, 654-667.
2. AGARWAL, P. K., AND MATOUŠEK, J. 1995. Dynamic half-space range reporting and its applications. Algorithmica 13, 325-345.
3. AGARWAL, P. K., AND SHARIR, M. 2000. Arrangements and their applications. In Handbook of Computational Geometry, J. Urrutia and J. Sack, eds. North-Holland, Amsterdam, The Netherlands.
4. ANDRZEJAK, A., AND WELZL, E. 1997. k-sets and j-facets: A tour of discrete geometry. Manuscript.
5. BASCH, J., GUIBAS, L. J., AND RAMKUMAR, G. 1996. Reporting red-blue intersections between two sets of connected line segments. In Proceedings of the 4th European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1136. Springer-Verlag, New York, pp. 302-319.
6. BENTLEY, J., AND SAXE, J. 1980. Decomposable searching problems. I: Static-to-dynamic transformation. J. Algorithms 1, 301-358.
7. BÖHRINGER, K.-F., DONALD, B. R., AND HALPERIN, D. 1999. On the area bisectors of a polygon. Disc. Comput. Geom. 22, 269-285.
8. BRODAL, G. S., AND JACOB, R. 2000. Dynamic planar convex hull with optimal query time and O (log n · log log n) update time. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 1851. Springer-Verlag, Berlin, Germany, pp. 57-70.
9. CHAN, T. M. 1996. Output-sensitive results on convex hulls, extreme points, and related problems. Disc. Comput Geom. 16, 369-387.
10. CHAN, T. M. 1999. Remarks on k-level algorithms in the plane. Manuscript.
11. CHAN, T. M. 2001. Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions. SIAM J. Comput. 30, 561-575.
12. CHAZELLE, B. 1985. On the convex layers of a planar set. IEEE Trans. Inf. Theory IT-31, 509-517.
13. CHAZELLE, B., AND EDELSBRUNNER, H. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Trans. Comput. C-36, 1349-1354.
14. CHIANG, Y.-J., AND TAMASSIA, R. 1992. Dynamic algorithms in computational geometry. Proc. IEEE 80, 1412-1434.
15. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, Mass.
16. DE BERG, M., VAN KREVELD, M., OVERMARS, M., AND SCHWARZKOPF, O. 1997. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany.
17. DEVILLERS, O., AND KATZ, M. J. 1999. Optimal line bipartitions of point sets. Int. J. Comput. Geom. Appl. 1, 39-51.
18. DOBKIN, D., EPPSTEIN, D., AND MITCHELL, D. P. 1996. Computing the discrepancy with applications to supersampling patterns. ACM Trans. Graph. 15, 354-376.
19. DOBKIN, D. P., AND KIRKPATRICK, D. G. 1983. Fast detection of polyhedral intersection. Theoret. Comput. Sci. 27, 241-253.
20. EDELSBRUNNER, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, Germany.
21. EDELSBRUNNER, H., AND WELZL, E. 1986. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., 15, 271-284.
22. FRIEDMAN, J., HERSHBERGER, J., AND SNOEYINK, J. 1996. Efficiently planning compliant motion in the plane. SIAM J. Comput. 25, 562-599.
23. GHALI, S., AND STEWART, A. J. 1996. Maintenance of the set of segments visible from a moving viewpoint in two dimensions. In Proceedings of the 12th Annual ACM Symposium on Computational Geometry (Philadelphia, Pa., May 24-26). ACM, New York, pp. V3-V4.
24. HAR-PELED, S. 1999. Taking a walk in a planar arrangement. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 100-110.
25. HERSHBERGER, J., AND SURI, S. 1991. Finding tailored partitions. J. Algorithms 12, 431-463.
26. HERSHBERGER, J., AND SURI, S. 1992. Applications of a semi-dynamic convex hull algorithm. BIT 32, 249-267.
27. HERSHBERGER, J., AND SURI, S. 1996. Off-line maintenance of planar configurations. J. Algorithms 21, 453-475.
28. JANARDAN, R. 1993. On maintaining the width and diameter of a planar point-set online. Int. J. Comput. Geom. Appl. 3, 331-344.
29. KAPOOR, S. 1998. Dynamic maintenance of 2-d convex hulls and order decomposable problems. Manuscript.
30. MATOUSEK, J. 1995. On geometric optimization with few violated constraints. Disc. Comput. Geom. 14, 365-384.
31. MEGIDDO, N. 1983. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30, 852-865.
32. MEHLHORN, K. 1984. Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, Germany.
33. MULMULEY, K. 1991. Randomized multidimensional search trees: Lazy balancing and dynamic shuffling. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 180-196.
34. MULMULEY, K. 1994. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N.J.
35. OVERMARS, M. H. 1983. The Design of Dynamic Data Structures. Lecture Notes in Computer Science, Vol. 156. Springer-Verlag, New York.
36. OVERMARS, M. H., AND VAN LEEUWEN, J. 1981. Maintenance of configurations in the plane. J. Comput. Sys. Sci. 23, 166-204.
37. PREPARATA, F. P., AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.
38. RAMOS, E. A. 1999. On range reporting, ray shooting, and k-level construction. In Proceedings of the 15th Annual ACM Symposium on Computational Geometry (Miami Beach, Fla., June 13-16). ACM, New York, pp. 390-399.
39. ROTE, G., SCHWARZ, C., AND SNOEYINK, J. 1993. Maintaining the approximate width of a set of points in the plane. In Proceedings of the 5th Canadian Conference on Computational Geometry, pp. 258-263.
40. SCHWARZKOPF, O. 1991. Dynamic maintenance of geometric structures made easy. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computing Science. IEEE, New York, pp. 197-206.