Recursive voids for identifying a nonconvex boundary of a set of points in the plane
We introduce a method that identifies a nonconvex boundary of points in the plane. The nonconvex boundary is explored through finding empty regions recursively. Our algorithm is output sensitive and runs in linear time. We use a tree structure and a phylogenic measure to determine shape complexity. We present results on data size, shape length, shape complexity and noise.
nonconvex boundary output sensitivity linear time complexity computational geometry lowest common ancestor