| 基于变分网格的曲面简化高效算法 |
| |
| 引用本文： | 金勇,吴庆标,刘利刚. 基于变分网格的曲面简化高效算法[J]. 软件学报, 2011, 22(5): 1097-1105. DOI: 10.3724/SP.J.1001.2011.03750 |
| |
| 作者姓名： | 金勇 吴庆标 刘利刚 |
| |
| 作者单位： | 浙江大学,数学系,浙江,杭州,310027 |
| |
| 基金项目： | 国家自然科学基金，浙江省重大科技创新项目 |
| |
| 摘 要： | 根据变分网格逼近表示所定义的全局误差能量,提出一种局部贪心优化算法.该算法通过控制目标网格分片数来简化网格,通过种子的自适应选取来达到理想的简化效果,具有直观的几何意义.该方法计算量较小,效率较高,能够有效地应用于几何造型系统中.
|
| 关 键 词： | 多边形网格简化 变分网格逼近 贪心算法 几何造型 |
| 收稿时间： | 2009-06-23 |
| 修稿时间： | 2009-10-10 |
Efficient Algorithm for Surface Simplification Based on Variational Mesh |
| |
| JIN Yong,WU Qing-Biao and LIU Li-Gang. Efficient Algorithm for Surface Simplification Based on Variational Mesh[J]. Journal of Software, 2011, 22(5): 1097-1105. DOI: 10.3724/SP.J.1001.2011.03750 |
| |
| Authors: | JIN Yong WU Qing-Biao LIU Li-Gang |
| |
| Affiliation: | (Department of Mathematics,Zhejiang University,Hangzhou 310027,China) |
| |
| 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. |
| |
| Keywords: | polygon mesh simplification variational mesh approximation greedy algorithm geometric modeling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
