Article

Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time

Author:

Timothy M. ChanAuthors Info & Claims

FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

October 1999

Page 92

Published: 17 October 1999 Publication History

Abstract

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(log{1+eps}n) amortized time and queries take O(log n) time each, where n is the maximum size of P and eps is any fixed positive constant. For some advanced queries such as bridge-finding, both our bounds increase to O(log{3/2}n). The only previous fully dynamic solution was by Overmars and van Leeuwen from 1981 and required O(log2 n) time per update.

References

[1]

P. K. Agarwal, M. de Berg, J. Matou¿ek, and O. Schwarzkopf. Constructing levels in arrangements and higher order Voronoi diagrams. SIAM J. Comput., 27:654-667, 1998.

[2]

P. K. Agarwal and J. Matou¿ek. Dynamic half-space range reporting and its applications. Algorithmica, 13:325-345, 1995.

[3]

P. K. Agarwal and M. Sharir. Arrangements and their applications. To appear in Handbook of Computational Geometry (J. Urrutia and J. Sack, ed.), North-Holland.

[4]

A. Andrzejak and E. Welzl. k-sets and j-facets: a tour of discrete geometry. Manuscript, 1997.

[5]

J. Basch, L. J. Guibas, and G. Ramkumar. Reporting red-blue intersections between two sets of connected line segments. In Proc. 4th European Sympos. Algorithms, Lect. Notes in Comput. Sci., vol. 1136, Springer-Verlag, pages 302-319, 1996.

[6]

J. Bentley and J. Saxe. Decomposable searching problems I: static-to-dynamic transformation. J. Algorithms , 1:301-358, 1980.

[7]

M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.

[8]

K.-F. Böhringer, B. R. Donald, and D. Halperin. On the area bisectors of a polygon. Discrete Comput. Geom., 22:269-285, 1999.

[9]

T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Comput. Geom., 16:369-387, 1996.

[10]

T. M. Chan. Random sampling, halfspace range reporting, and construction of (¿ k)-levels in three dimensions. In Proc. 39th IEEE Sympos. Found. Comput. Sci., pages 586-595, 1998.

[11]

T. M. Chan. Remarks on k-level algorithms in the plane. Manuscript, 1999.

[12]

B. Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31:509-517, 1985.

[13]

B. Chazelle and H. Edelsbrunner. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Trans. Comput., C-36:1349-1354, 1987.

[14]

Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proc. of the IEEE, 80:1412- 1434, 1992.

[15]

T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass., 1990.

[16]

O. Devillers and M. J. Katz. Optimal line bipartitions of point sets. Int. J. Comput. Geom. Appl., 1:39-51, 1999.

[17]

D. Dobkin and D. Eppstein. Computing the discrepancy. In Proc. 9th ACM Sympos. Comput. Geom., pages 47-52, 1993.

[18]

D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27:241-253, 1983.

[19]

H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.

[20]

H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., 15:271-284, 1986.

[21]

J. Friedman, J. Hershberger, and J. Snoeyink. Efficiently planning compliant motion in the plane. SIAM J. Comput., 25:562-599, 1996.

[22]

S. Ghali and A. J. Stewart. Maintenance of the set of segments visible from a moving viewpoint in two dimensions. In Proc. 12th ACM Sympos. Comput. Geom., pages V3-V4, 1996.

[23]

S. Har-Peled. Taking a walk in a planar arrangement. In these proceedings.

[24]

J. Hershberger and S. Suri. Finding tailored partitions. J. Algorithms, 12:431-463, 1991.

[25]

J. Hershberger and S. Suri. Applications of a semidynamic convex hull algorithm. BIT, 32:249-267, 1992.

Digital Library

[26]

J. Hershberger and S. Suri. Off-line maintenance of planar configurations. J. Algorithms, 21:453-475, 1996.

[27]

R. Janardan. On maintaining the width and diameter of a planar point-set online. Int. J. Comput. Geom. Appl., 3:331-344, 1993.

[28]

S. Kapoor. Dynamic maintenance of 2-d convex hulls nd order decomposable problems. Manuscript, 1998.

[29]

J. Matou¿ek. On geometric optimization with few violated constraints. Discrete Comput. Geom., 14:365- 384, 1995.

[30]

K. Mehlhorn. Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry. Springer-Verlag, Heidelberg, 1984.

[31]

K. Mulmuley. Randomized multidimensional search trees: lazy balancing and dynamic shuffling. In Proc. 32nd IEEE Sympos. Found. Comput. Sci., pages 180- 196, 1991.

[32]

K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, N.J., 1994.

[33]

M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Sys. Sci., 23:166-204, 1981.

[34]

F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.

[35]

E. Ramos. On range reporting, ray shooting, and k-level construction. In Proc. 15th ACM Sympos. Comput. Geom., pages 390-399, 1999.

[36]

G. Rote, C. Schwarz, and J. Snoeyink. Maintaining the approximate width of a set of points in the plane. In Proc. 5th Canad. Conf. Comput. Geom., pages 258-263, 1993.

[37]

O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. In Proc. 32nd IEEE Sympos. Found. Comput. Sci., pages 197-206, 1991.

Cited By

Acar UBlelloch GBlume MHarper RTangwongsan K(2009)An experimental analysis of self-adjusting computationACM Transactions on Programming Languages and Systems10.1145/1596527.159653032:1(1-53)Online publication date: 4-Nov-2009
https://dl.acm.org/doi/10.1145/1596527.1596530
Acar ULey-Wild R(2008)Self-adjusting computation with Delta MLProceedings of the 6th international conference on Advanced functional programming10.5555/1813347.1813348(1-38)Online publication date: 19-May-2008
https://dl.acm.org/doi/10.5555/1813347.1813348
Demaine EPatrascu MErickson J(2007)Tight bounds for dynamic convex hull queries (again)Proceedings of the twenty-third annual symposium on Computational geometry10.1145/1247069.1247131(354-363)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.1145/1247069.1247131
Show More Cited By

Index Terms

Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
1. Theory of computation
  1. Randomness, geometry and discrete structures

Index terms have been assigned to the content through auto-classification.

Recommendations

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(log^1+εn) amori tzed time and queries take O (log n ...
Read More
Dynamic Planar Convex Hull with Optimal Query Time
SWAT '00: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory

The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n ċ log log log n) time, point ...
Read More
Dynamic Planar Convex Hull
FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science

In this paper we determine the computational complexity of the dynamic convex hull problem in the planar case. We present a data structure that maintains a finite set of n points in the plane under insertion and deletion of points in amortized O(log n) ...
Read More

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science

October 1999

ISBN:0769504094

Copyright © Copyright (c) 1998 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 17 October 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Acar UBlelloch GBlume MHarper RTangwongsan K(2009)An experimental analysis of self-adjusting computationACM Transactions on Programming Languages and Systems10.1145/1596527.159653032:1(1-53)Online publication date: 4-Nov-2009
https://dl.acm.org/doi/10.1145/1596527.1596530
Acar ULey-Wild R(2008)Self-adjusting computation with Delta MLProceedings of the 6th international conference on Advanced functional programming10.5555/1813347.1813348(1-38)Online publication date: 19-May-2008
https://dl.acm.org/doi/10.5555/1813347.1813348
Demaine EPatrascu MErickson J(2007)Tight bounds for dynamic convex hull queries (again)Proceedings of the twenty-third annual symposium on Computational geometry10.1145/1247069.1247131(354-363)Online publication date: 6-Jun-2007
https://dl.acm.org/doi/10.1145/1247069.1247131
Kettner LKirkpatrick DMantler ASnoeyink JSpeckmann BTakeuchi F(2003)Tight degree bounds for pseudo-triangulations of pointsComputational Geometry: Theory and Applications10.1016/S0925-7721(02)00126-825:1-2(3-12)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1016/S0925-7721%2802%2900126-8
Kaplan HTarjan RTsioutsiouliklis KKosaraju S(2001)Faster kinetic heaps and their use in broadcast schedulingProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365793(836-844)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365793
Har-Peled SSharir MKosaraju S(2001)Online point location in planar arrangements and its applicationsProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365419(57-66)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365419
Mitchell JO'Rourke J(2001)Computational geometryACM SIGACT News10.1145/500559.50056232:3(63-72)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1145/500559.500562
Katoh NTokuyama T(2001)Notes on computing peaks in k-levels and parametric spanning treesProceedings of the seventeenth annual symposium on Computational geometry10.1145/378583.378675(241-248)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1145/378583.378675
Agarwal PDesikan PShmoys D(2000)Approximation algorithms for layered manufacturingProceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms10.5555/338219.338602(528-537)Online publication date: 1-Feb-2000
https://dl.acm.org/doi/10.5555/338219.338602
Har-Peled S(1999)Taking a Walk in a Planar ArrangementProceedings of the 40th Annual Symposium on Foundations of Computer Science10.5555/795665.796514Online publication date: 17-Oct-1999
https://dl.acm.org/doi/10.5555/795665.796514

View Options

View options

Media

Figures

Other

Tables

View Table of Contents