| 三角网格简化的一种新方法——抽取算法 |
| |
| 引用本文： | 刘军,张树生,白晓亮,朱润新.三角网格简化的一种新方法——抽取算法[J].机械科学与技术(西安),2007,26(3):344-346. |
| |
| 作者姓名： | 刘军 张树生 白晓亮 朱润新 |
| |
| 作者单位： | 西北工业大学现代设计与集成制造技术教育部重点实验室,西安710072 |
| |
| 摘 要： | 介绍曲面重构中有效减少三角曲面片的方法——抽取算法,这种算法使用网格顶点的局部几何拓扑特性,改变网格顶点到特征边的距离以及特征边之间的角度,在三角网格上产生位移,减少三角网格的数目;删除网格顶点而产生的“拓扑洞”由局部三角化来修补。
|
| 关 键 词： | 抽取算法 三角网格 网格顶点 |
| 文章编号： | 1003-8728（2007）03-0344-03 |
| 修稿时间： | 2005-07-15 |
Extraction Algorithm as a New Method for Simplifying Triangular Lattices |
| |
| Liu Jun,Zhang Shusheng,Bai Xiaoliang,Zhu Runxin.Extraction Algorithm as a New Method for Simplifying Triangular Lattices[J].Mechanical Science and Technology,2007,26(3):344-346. |
| |
| Authors: | Liu Jun Zhang Shusheng Bai Xiaoliang Zhu Runxin |
| |
| Abstract: | The paper presented the extraction algorithm as an effective method for reducing the number of triangular surfaces during surface reconstruction. The algorithm uses the local geometrical and topological characteristics of lattice vertices to change the distance from vertex to eigen-sides and the angle between eigen-sides and to make displacement over triangular lattices, thus reducing the number of triangular lattices. The topological holes left over by lattice vertex deletion are patched by local triangulation. |
| |
| Keywords: | extraction algorithm triangular lattice lattice vertex |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
