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

基于曲面局平特性的散乱数据拓扑重建算法
引用本文:谭建荣,李立新.基于曲面局平特性的散乱数据拓扑重建算法[J].软件学报,2002,13(11):2121-2126.
作者姓名:谭建荣  李立新
作者单位:浙江大学,CAD&CG国家重点实验室,浙江,杭州,310027
基金项目:国家自然科学基金资助项目(69873038;69425005);国家教育部博士点基金资助项目(98033506)
摘    要:提出了一种基于曲面局平特性的,以散乱点集及其密度指标作为输入,以三角形分片线性曲面作为输出的拓扑重建算法.算法利用曲面的局平特性,从散乱点集三维Delaunay三角剖分的邻域结构中完成每个样点周围的局部拓扑重建,并从局部重建的并集中删除不相容的三角形,最终得到一个二维流形拓扑曲面集作为重建结果.该算法适应于包括单侧曲面在内的任意不自交的拓扑曲面集,并且重建结果是相对优化的曲面三角形剖分,可以应用于科学计算可视化、雕塑曲面造型和反求工程等领域.

关 键 词:散乱点集  拓扑重建  曲面局平特性  Delaunay三角剖分  可视化  雕塑曲面造型  反求工程
文章编号:1000-9825/2002/13(11)2121-06
收稿时间:2/6/2001 12:00:00 AM
修稿时间:2001年2月6日

An Algorithm for Topology Reconstruction from Unorganized Points Based on Local Flatness of Surface
TAN Jian-rong and LI Li-xin.An Algorithm for Topology Reconstruction from Unorganized Points Based on Local Flatness of Surface[J].Journal of Software,2002,13(11):2121-2126.
Authors:TAN Jian-rong and LI Li-xin
Abstract:An algorithm for topology reconstruction is promoted that takes as input an unorganized set of points with known density and carries out as output simplicial surfaces. This algorithm uses the local flatness of surface, searches the local reconstruction for every point from the 3D Delaunay triangulation, and from the union of such locale reconstruction, carries out corresponding manifolds by deleting incompatible triangles. With an optimizing surface triangulation as result, this algorithm is suitable for surfaces of arbitrary topology, including nonorientable ones, hence can be applicable to visualization in scientific computing, sculpture surface modeling, and reverse engineering.
Keywords:unorganized points  topology reconstruction  flatness of surface  Delaunay triangulation  visualization  sculpture surface modeling  reverse engineering
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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