Dynamic Planar Convex hull
Riko Jacob May 2002 |
Abstract:
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 points in the plane under insertion and deletion of points in
amortized
![]() ![]() ![]() Available as PostScript, PDF. |