Recursive voids for identifying a nonconvex boundary of a set of points in the plane
作者：
Highlights：
• 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.
摘要
Highlights•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,Linear time complexity,Output sensitivity,Computational geometry,Lowest common ancestor
论文评审过程：Received 10 January 2013, Revised 12 March 2013, Accepted 9 May 2013, Available online 23 May 2013.
论文官网地址：https://doi.org/10.1016/j.patcog.2013.05.013
