A Boundary Construction Algorithm for a Complex Planar Point Set
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 para...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/8156630 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832548901472698368 |
|---|---|
| author | Zhenxiu Liao Guodong Shi |
| author_facet | Zhenxiu Liao Guodong Shi |
| author_sort | Zhenxiu Liao |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-8cae14afae8743b09d7e0004715c91db |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-8cae14afae8743b09d7e0004715c91db2025-02-03T06:12:50ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/81566308156630A Boundary Construction Algorithm for a Complex Planar Point SetZhenxiu Liao0Guodong Shi1School of Civil Engineering, Anhui Jianzhu University, Hefei, Anhui 230601, ChinaSchool of Civil Engineering, Anhui Jianzhu University, Hefei, Anhui 230601, ChinaIt 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.http://dx.doi.org/10.1155/2021/8156630 |
| spellingShingle | Zhenxiu Liao Guodong Shi A Boundary Construction Algorithm for a Complex Planar Point Set Complexity |
| title | A Boundary Construction Algorithm for a Complex Planar Point Set |
| title_full | A Boundary Construction Algorithm for a Complex Planar Point Set |
| title_fullStr | A Boundary Construction Algorithm for a Complex Planar Point Set |
| title_full_unstemmed | A Boundary Construction Algorithm for a Complex Planar Point Set |
| title_short | A Boundary Construction Algorithm for a Complex Planar Point Set |
| title_sort | boundary construction algorithm for a complex planar point set |
| url | http://dx.doi.org/10.1155/2021/8156630 |
| work_keys_str_mv | AT zhenxiuliao aboundaryconstructionalgorithmforacomplexplanarpointset AT guodongshi aboundaryconstructionalgorithmforacomplexplanarpointset AT zhenxiuliao boundaryconstructionalgorithmforacomplexplanarpointset AT guodongshi boundaryconstructionalgorithmforacomplexplanarpointset |