基于STL文件的Laplacian网格优化算法

Laplacian mesh optimization algorithm based on STL file

针对直接重构得到且以STL文件格式存储的网格模型质量不高的问题,提出了一种基于Laplacian坐标的网格模型全局优化算法。该算法在提高三角面片质量的同时可以很好地保持原网格模型的局部几何特征,其核心思想是通过在最小二乘意义下求解由权重控制的包含顶点位置和拉普拉斯坐标双重约束的线性系统来对网格顶点进行重新定位。从实验结果可以看出,该算法较以往的Lapacian优化算法在对网格细节特征的保持上有一定优势。

To the problem that triangle quality of mesh model reconstructed directly often was not very good, this paper intro- duced a algorithm for global optimization of triangular meshes that was guided by the vertex Laplacians. The technique success- fully improved the quality of the triangulation while remaining details faithfully to the original surface geometry. The core idea of this alorithm was vertex relocation basied on optimum relation of linear system that approximate prescribed Laplaeians and positions in a weighted least-squares sense. Result of experiment shows that this algorithm is good at remaining details faithfully to foregone Laolaeian ootimization algorithm.