张明敏,周 昆,潘志庚.基于超包络的三角形网格简化算法.软件学报,1999,10(6):584-588 |
基于超包络的三角形网格简化算法 |
Triangle Mesh Simplification Algorithm Based on Super-envelopes |
投稿时间:1998-01-08 修订日期:1998-07-14 |
DOI: |
中文关键词: 三角形网格,包络,网格简化,累进网格. |
英文关键词:Triangle mesh, envelope, mesh simplification, progressive meshes. |
基金项目:本文研究得到国家自然科学基金和浙江大学曹光彪高科技基金资助. |
|
摘要点击次数: 2803 |
全文下载次数: 2799 |
中文摘要: |
文章提出了一种基于超包络的三角形网格简化算法.该算法不仅适用于任意拓扑结构的网格,而且能定量控制简化的全局误差,具有速度快、效果好的优点.在此算法的基础上,文章提出了一种连续细节层次模型的生成方法,并给出一组实例,说明了算法的有效性.另外,文章还将此算法与其他具有全局误差控制的简化算法进行了比较. |
英文摘要: |
An algorithm for triangle mesh simplification based on super-envelopes is presented in this paper. This algorithm can not only deal with arbitrary meshes, but also control the global error bound of the simplification. It runs fast and the result is perfect. The authors also give a method for constructing continuous level of detail models. Examples illustrate efficiency of the algorithm. Finally, the authors compare the algorithm with those algorithms with global error control. |
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |