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

一种改进的区域扩张三角网格面逆向重构算法
引用本文:林志浩,姜晓峰,王鹏远. 一种改进的区域扩张三角网格面逆向重构算法[J]. 小型微型计算机系统, 2006, 27(8): 1570-1573
作者姓名:林志浩  姜晓峰  王鹏远
作者单位:苏州大学,计算机科学与技术学院,江苏,苏州,215006
摘    要:
三角网格面重构是逆向工程中常用的曲面重构方法之一.本文提出了一种基于局部信息的区域扩张算法(LIBRG),用以解决由离散点云重构三角网格面的问题.该算法由一个初始三角片开始,扩张式地搜索满足要求的点以生成新的三角片.算法充分利用了区域扩张过程中的局部空间信息,所以能很好地适应曲率的变化并自动筛选掉一些无效点;同时LIBRG算法也针对传统算法中的全程遍历搜索方式进行了改进,以获得较高的时间效率.

关 键 词:逆向工程  曲面重构  三角网格  区域扩张
文章编号:1000-1220(2006)08-1570-04
收稿时间:2005-05-16
修稿时间:2005-05-16

Improved Region Growing Triangulation Reconstruction Algorithm
LIN Zhi-hao,JIANG Xiao-feng,WANG Peng-yuan. Improved Region Growing Triangulation Reconstruction Algorithm[J]. Mini-micro Systems, 2006, 27(8): 1570-1573
Authors:LIN Zhi-hao  JIANG Xiao-feng  WANG Peng-yuan
Abstract:
Triangulation reconstruction is one of the widely used surface reconstruction techniques in reverse engineering. This paper presents a Local Information Based Region-Growing (LIBRG) algorithm, which is supposed to solve the problems of surface triangulation reconstruction from scattered points. Begin with an initial triangle, this algorithm growingly searches the satisfied points to form new triangles. Since the local region information it explores, the algorithm greatly adapts the variety of surface curvature and also filters the invalid points automatically, while achieves the good time efficiency using improved searching techniques.
Keywords:reverse engineering    surface reconstruction    triangulation    region growing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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