STL Triangular Mesh Generation Based on SAT Model
Yiqi Zhou, Yuwei Zhang, Yuwei Zhang, Xiaofeng Zhao
Abstract
Open-access reader
Yiqi Zhou, Yuwei Zhang, Yuwei Zhang, Xiaofeng Zhao
Abstract
Open-access reader
Mesh generation is a fundamental technique in multiple domains. In this study, a STL triangular mesh generation method based on SAT model is proposed. Two novel triangulation methods, the constrained Delaunay algorithm and the grid subtraction algorithm, are employed on the multi-loop planer regions and the curved surfaces respectively. For the use of node adjustment, the mesh nodes on the surface boundary are strictly matched, with no cracks created on the joint of model surfaces. Experiments show that the proposed solution works effectively and high quality of the mesh model is achieved.
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.
Mesh generation is a fundamental technique in multiple domains. In this study, a STL triangular mesh generation method based on SAT model is proposed. Two novel triangulation methods, the constrained Delaunay algorithm and the grid subtraction algorithm, are employed on the multi-loop planer regions and the curved surfaces respectively. For the use of node adjustment, the mesh nodes on the surface boundary are strictly matched, with no cracks created on the joint of model surfaces. Experiments show that the proposed solution works effectively and high quality of the mesh model is achieved.
Key concepts: Delaunay triangulation, Ruppert's algorithm, Mesh generation, Chew's second algorithm, Triangle mesh, Computer science, Laplacian smoothing, Algorithm