Dynamic planar convex hull operations in near-logarithmic amortized time
- 1 January 2001
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 48 (1), 1-12
- https://doi.org/10.1145/363647.363652
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+ε n ) amori tzed time and queries take O (log n time each, where n is the maximum size of P and ε 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 (log 2 n ) time per update and O (log n ) time per query.Keywords
This publication has 29 references indexed in Scilit:
- Off-Line Maintenance of Planar ConfigurationsJournal of Algorithms, 1996
- Computing the discrepancy with applications to supersampling patternsACM Transactions on Graphics, 1996
- Dynamic half-space range reporting and its applicationsAlgorithmica, 1995
- Applications of a semi-dynamic convex hull algorithmBIT Numerical Mathematics, 1992
- Dynamic algorithms in computational geometryProceedings of the IEEE, 1992
- Finding tailored partitionsJournal of Algorithms, 1991
- On the convex layers of a planar setIEEE Transactions on Information Theory, 1985
- Fast detection of polyhedral intersectionTheoretical Computer Science, 1983
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980