An efficient incremental algorithm for generating the characteristic shape of a dynamic set of points in the plane

Several algorithms have been proposed to generate a polygonal footprint' to characterize the shape of a set of points in the plane. One widely used type of footprint is the -shape. Based on the Delaunay triangulation (DT), -shapes guaranteed to be simple (Jordan) polygons. This paper presents for the first time an incremental -shape algorithm, capable of processing point data streams. Our incremental -shape algorithm allows both insertion and deletion operations, and can handle streaming individual points and multiple point sets. The experimental results demonstrated that the incremental algorithm is significantly more efficient than the existing, batch -shape algorithm for processing a wide variety of point data streams.