摘要
提出了一种基于曲面局平特性的,以散乱点集及其密度指标作为输入,以三角形分片线性曲面作为输出的拓扑重建算法.算法利用曲面的局平特性,从散乱点集三维Delaunay三角剖分的邻域结构中完成每个样点周围的局部拓扑重建,并从局部重建的并集中删除不相容的三角形,最终得到一个二维流形拓扑曲面集作为重建结果.该算法适应于包括单侧曲面在内的任意不自交的拓扑曲面集,并且重建结果是相对优化的曲面三角形剖分,可以应用于科学计算可视化、雕塑曲面造型和反求工程等领域.
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.
出处
《软件学报》
EI
CSCD
北大核心
2002年第11期2121-2126,共6页
Journal of Software
基金
国家自然科学基金资助项目(69873038
69425005)
国家教育部博士点基金资助项目(98033506)~~
关键词
曲面局平特性
散乱数据
拓扑重建算法
DELAUNAY三角剖分
可视化
反求工程
CAD
unorganized points
topology reconstruction
flatness of surface
Delaunay triangulation
visualization
sculpture surface modeling
reverse engineering
