Journal of Software:2011.22(5):1097-1105

(浙江大学 数学系,浙江 杭州 310027)
Efficient Algorithm for Surface Simplification Based on Variational Mesh
JIN Yong,WU Qing-Biao,LIU Li-Gang
(Department of Mathematics, Zhejiang University, Hangzhou 310027, China)
Chart / table
Similar Articles
Article :Browse 3394   Download 3538
Received:June 23, 2009    Revised:October 10, 2009
> 中文摘要: 根据变分网格逼近表示所定义的全局误差能量,提出一种局部贪心优化算法.该算法通过控制目标网格分片数来简化网格,通过种子的自适应选取来达到理想的简化效果,具有直观的几何意义.该方法计算量较小,效率较高,能够有效地应用于几何造型系统中.
Abstract:The paper presents a local greedy algorithm that minimizes the energy defined by a variational mesh approximation. The algorithm simplifies the mesh by controlling the number of target polygons, while attempting to gain ideal effect from adaptively selected seed triangles. The algorithm has an intuitive geometric meaning. The algorithm is efficient enough to be efficiently adopted in the geometric modeling system.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(10871178, 60776799); 浙江省重大科技创新项目(2008C01048-3) 国家自然科学基金(10871178, 60776799); 浙江省重大科技创新项目(2008C01048-3)
Foundation items:
Reference text:


JIN Yong,WU Qing-Biao,LIU Li-Gang.Efficient Algorithm for Surface Simplification Based on Variational Mesh.Journal of Software,2011,22(5):1097-1105