The Construction of Delaunay Triangulation Using Point-insertion Method Based on Qi Algorithm
Hui Zhou
Abstract
Hui Zhou
Abstract
Delaunay Triangulation has a wide range of application in various fields,and it is very important to generate Delaunay Triangulation efficiently.After analyzing the procedure of construction of Delaunay Triangulation without control boundary using point-insertion method,the authors introduced the Qi algorithm to the key step of building node-topology.The Qi algorithm was adopted again when inserting constrained boundaries into the Delaunay Triangulation to improve the efficiency.In order to verify the algorithm presented in this paper,the authors implemented algorithms using C in VS.NET.The experiment shows that the introduction of the Qi algorithm can improve the efficiency of building Delaunay Triangulation using point-insertion method.
A significance statement is not available in the OpenAlex record.
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.
Delaunay Triangulation has a wide range of application in various fields,and it is very important to generate Delaunay Triangulation efficiently.After analyzing the procedure of construction of Delaunay Triangulation without control boundary using point-insertion method,the authors introduced the Qi algorithm to the key step of building node-topology.The Qi algorithm was adopted again when inserting constrained boundaries into the Delaunay Triangulation to improve the efficiency.In order to verify the algorithm presented in this paper,the authors implemented algorithms using C in VS.NET.The experiment shows that the introduction of the Qi algorithm can improve the efficiency of building Delaunay Triangulation using point-insertion method.
Key concepts: Delaunay triangulation, Bowyer–Watson algorithm, Constrained Delaunay triangulation, Pitteway triangulation, Chew's second algorithm, Minimum-weight triangulation, Ruppert's algorithm, Surface triangulation