The Algorithm of 3D Constrained Delaunay Triangulation
Yongan Xu
Abstract
Yongan Xu
Abstract
In this paper, the boundary conformability of 3D constrained Delaunay triangulation is analyzed. Based on the theory of Delaunay triangulation, the feasibility of 3D constrained Delaunay triangulation is discussed emphatically. The algorithm of 3D constrained Delaunay triangulation of finite domain is designed. Applications in oil and geological exploration and mechanical part design are illustrated. The algorithm plays an important role in the computation and analysis of complicated objects.
OpenAlex reports 7 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.
In this paper, the boundary conformability of 3D constrained Delaunay triangulation is analyzed. Based on the theory of Delaunay triangulation, the feasibility of 3D constrained Delaunay triangulation is discussed emphatically. The algorithm of 3D constrained Delaunay triangulation of finite domain is designed. Applications in oil and geological exploration and mechanical part design are illustrated. The algorithm plays an important role in the computation and analysis of complicated objects.
Key concepts: Delaunay triangulation, Constrained Delaunay triangulation, Bowyer–Watson algorithm, Pitteway triangulation, Surface triangulation, Chew's second algorithm, Computer science, Ruppert's algorithm