Dynamic Planar Convex Hull with Optimal Query Time and O ( log n · log log n ) Update Time Gerth

Abstract

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 logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n… (More)

Topics

3 Figures and Tables