Grid Partition Variable Step Alpha Shapes Algorithm. (18th May 2021)

• Record Type: Journal Article
• Authors: Liao, Zhenxiu; Liu, Jun; Shi, Guodong; Meng, Junxia
• Other Names: Hayat Sakander Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-05-18
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/9919003
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : On the basis of Alpha Shapes boundary extraction algorithm for discrete point set, a grid partition variable step Alpha Shapes algorithm is proposed to deal with the shortcomings of the original Alpha Shapes algorithm in the processing of nonuniform distributed point set and multiconcave point set. Firstly, the grid partition and row-column index table are established for the point set, and the point set of boundary grid partition is quickly extracted. Then, the average distance of the k -nearest neighbors of the point is calculated as the value of α . For the point set of boundary grid partition extracted in the previous step, Alpha Shapes algorithm is used to quickly construct the point set boundary. The proposed algorithm is verified by experiments of simulated point set and measured point set, and it has high execution efficiency. Compared with similar algorithms, the larger the number of point sets is, the more obvious the execution efficiency is.