Chuanlin Zhang
Abstract
A simple dynamic polygon triangulation algorithm is proposed,its time complexity is O(n).The correctness of the algorithm is proved,and a dynamic triangular mesh generation software is developed.Finally it tested the robustness of the software through a large number of data.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A simple dynamic polygon triangulation algorithm is proposed,its time complexity is O(n).The correctness of the algorithm is proved,and a dynamic triangular mesh generation software is developed.Finally it tested the robustness of the software through a large number of data.
Key concepts: Delaunay triangulation, Surface triangulation, Bowyer–Watson algorithm, Minimum-weight triangulation, Correctness, Computer science, Pitteway triangulation, Constrained Delaunay triangulation