Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure

In this paper we present an effective kinetic data structure (KDS) and algorithm for efficient maintenance of convex hull of moving points in 2d space. Given n objects continuously moving in the plane we present an efficient algorithm for maintaining their convex hull. Our algorithm considers cases based on status of a constant number of points. We show that our algorithm´s time and space complexity are at most linear. A simulation program developed for testing the algorithm confirms the claim.