Dynamic Geometric Data Structures via Shallow Cuttings
Symposium on Computational Geometry, 2019.
We present new results on a number of fundamental problems about dynamic geometric data structures: 1. We describe the first fully dynamic data structures with sublinear amortized update time for maintaining (i) the number of vertices or the volume of the convex hull of a 3D point set, (ii) the largest empty circle for a 2D point set, (ii...More
PPT (Upload PPT)