A Boundary Construction Algorithm for a Complex Planar Point Set | Zendy

Zhenxiu Liao | Zendy; Guodong Shi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Boundary Construction Algorithm for a Complex Planar Point Set

Author(s) -

Zhenxiu Liao,

Guodong Shi

Publication year - 2021

Publication title -

complexity

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.447

H-Index - 61

eISSN - 1099-0526

pISSN - 1076-2787

DOI - 10.1155/2021/8156630

Subject(s) - delaunay triangulation , boundary (topology) , constrained delaunay triangulation , point (geometry) , bowyer–watson algorithm , algorithm , planar , set (abstract data type) , pitteway triangulation , triangulation , mathematics , surface triangulation , computer science , mathematical optimization , topology (electrical circuits) , geometry , mathematical analysis , combinatorics , computer graphics (images) , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research