Affiliation:
1. School of Civil Engineering, Anhui Jianzhu University, Hefei, Anhui 230601, China
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.
Funder
Nature Science Research Project of Anhui Education Department
Subject
Multidisciplinary,General Computer Science
Reference21 articles.
1. Two-step adaptive extraction method for ground points and breaklines from lidar point clouds
2. Extracting and understanding urban areas of interest using geotagged photos
3. Novel algorithm for fast extracting edges from massive point clouds;Z. Y. Wang;Computer Engineering and Applications,2010
4. Algorithms study of building boundary extraction and normalization based on LiDAR data;W. Shen;Journal of Remote Sensing,2008
5. Extraction of building contour from point clouds using dual threshold Alpha shapes algorithm;Y. F. Li;Journal of Yangtze River Scientific Research Institute,2016