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

一种散乱数据的三角剖分新算法
引用本文:慈瑞梅,李东波,童一飞.一种散乱数据的三角剖分新算法[J].计算机集成制造系统,2005,11(11):1640-1643.
作者姓名:慈瑞梅  李东波  童一飞
作者单位:南京理工大学,机械工程学院,江苏,南京,210094
基金项目:总装备部“十五”预研资助项目(41318.1.1.7),江苏省自然科学基金项目(BK2003095)~~
摘    要:根据逆向工程中散乱数据点规模越来越大的趋势,为缩小剖分时搜寻和遍历数据点的空间范围,提高算法效率,提出了一种大规模散乱数据的空间划分方法及相应的数据结构和编码方案.同时,提出了外连剖分和内连剖分的概念,给出了基于局部增量网格扩张的3维散乱数据点的空间直接三角剖分算法.该算法的总体计算复杂度为O(N),与三角剖分的典型算法相比,有效降低了其时间复杂度,提高了剖分后网格的质量.

关 键 词:逆向工程  散乱数据  三角剖分  局部增量  网格扩张
文章编号:1006-5911(2005)11-1640-04
修稿时间:2004年9月21日

New triangulation algorithm for scattered points
CI Rui-mei,LI Dong-bo,TONG Yi-fei.New triangulation algorithm for scattered points[J].Computer Integrated Manufacturing Systems,2005,11(11):1640-1643.
Authors:CI Rui-mei  LI Dong-bo  TONG Yi-fei
Abstract:In order to deal with the trend of increasing large scattered data points set in reverse engineering,a space partition strategy with its corresponding data structure and encoding method was proposed to improve the triangulating and search efficiency.At the same time,the concepts of inner-connection and outer-connection were put forward and the direct triangulation algorithm from 3D scattered points based on the local incremental mesh expansion method was provided.The computational complexity of this algorithm was O(N).Compared to the typical triangulation algorithms,it has significantly reduced its time complexity and improved the mesh quality.
Keywords:reverse engineering  scattered points  triangulation  local increment  mesh expansion
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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