A Boundary Construction Algorithm for a Complex Planar Point Set. (18th June 2021)

• Record Type: Journal Article
• Authors: Liao, Zhenxiu; Shi, Guodong
• Other Names: Chen Huihua Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-06-18
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/8156630
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : It is difficult to extract the boundary of complex planar points with nonuniform distribution of point density, concave envelopes, and holes. To solve this problem, an algorithm is proposed in this paper. Based on Delaunay triangulation, the maximum boundary angle threshold is introduced as the parameter in the extraction of the rough boundary. Then, the point looseness threshold is introduced, and the fine boundary extraction is conducted for the local areas such as concave envelopes and holes. Finally, the complete boundary result of the whole point set is obtained. The effectiveness of the proposed algorithm is verified by experiments on the simulated point set and practical measured point set. The experimental results indicate that it has wider applicability and more effectiveness in engineering applications than the state-of-the-art boundary construction algorithms based on Delaunay triangulation.