首页 | 本学科首页   官方微博 | 高级检索  
     

基于STL文件的Laplacian网格优化算法
引用本文:许 斌,李忠科.基于STL文件的Laplacian网格优化算法[J].计算机应用研究,2013,30(5):1589-1592.
作者姓名:许 斌  李忠科
作者单位:第二炮兵工程大学 理学院, 西安710025
基金项目:国家科技支撑计划资助项目(2009BAI81B00)
摘    要:针对直接重构得到且以STL文件格式存储的网格模型质量不高的问题, 提出了一种基于Laplacian坐标的网格模型全局优化算法。该算法在提高三角面片质量的同时可以很好地保持原网格模型的局部几何特征, 其核心思想是通过在最小二乘意义下求解由权重控制的包含顶点位置和拉普拉斯坐标双重约束的线性系统来对网格顶点进行重新定位。从实验结果可以看出, 该算法较以往的Lapacian优化算法在对网格细节特征的保持上有一定优势。

关 键 词:STL文件    三角网格模型    离散微分几何    三角面片质量    全局优化    顶点重新定位

Laplacian mesh optimization algorithm based on STL file
XU Bin,LI Zhong-ke.Laplacian mesh optimization algorithm based on STL file[J].Application Research of Computers,2013,30(5):1589-1592.
Authors:XU Bin  LI Zhong-ke
Affiliation:School of Science, Second Artillery Engineering University, Xi'an 710025, China
Abstract:To the problem that triangle quality of mesh model reconstructed directly often was not very good, this paper introduced a algorithm for global optimization of triangular meshes that was guided by the vertex Laplacians. The technique successfully 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 Laplacians and positions in a weighted least-squares sense. Result of experiment shows that this algorithm is good at remaining details faithfully to foregone Laplacian optimization algorithm.
Keywords:STL file  triangular mesh model  discrete differential gemmetry  triangle quality  global optimization  vertex relocation
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号