The Algorithm of Interpolating Mesh Boundary Incremental Construction Based on Local 3D Delaunay
Huang Yunbao
Abstract
Huang Yunbao
Abstract
The quality and efficiency is very important in the method of mesh interpolating large scale measure points. An algorithm of interpolating mesh boundary incremental construction is presented in this paper based on local 3D-Delaunay, since it is difficult to realize mesh linear and 3D-Delaunay construction, which automatically generates mesh model from measured objects through its boundary locally 3D-Delaunay constructing, inflating, separating, self-trimming. Results of the examples show that the algorithm can linearly construct arbitrary topological mesh models whose vertices satisfy 3D-Delaunay property.
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.
The quality and efficiency is very important in the method of mesh interpolating large scale measure points. An algorithm of interpolating mesh boundary incremental construction is presented in this paper based on local 3D-Delaunay, since it is difficult to realize mesh linear and 3D-Delaunay construction, which automatically generates mesh model from measured objects through its boundary locally 3D-Delaunay constructing, inflating, separating, self-trimming. Results of the examples show that the algorithm can linearly construct arbitrary topological mesh models whose vertices satisfy 3D-Delaunay property.
Key concepts: Delaunay triangulation, Chew's second algorithm, Ruppert's algorithm, Boundary (topology), Algorithm, Mathematics, Bowyer–Watson algorithm, Trimming