摘要
在对非封闭曲面、简单封闭曲面和多连通封闭曲面的特点进行分析之后,提出了一种多连通封闭曲面离散点集的3D三角划分算法.该算法无须对离散点集所对应的自由曲面进行分片,直接在3D空间根据曲面的形态变化向前逐层推进生成三角网格.算法同时还适用于非封闭曲面和简单封闭曲面两种情形.实验结果表明,该算法的划分效果优良,能够满足曲面重构的需要.
After analyzing the feature of open surfaces, simple close surfaces and multiple connected close surfaces, a 3D triangulation algorithm which doesn't need partition the surface is proposed in this paper. In the 3D triangulation process, the triangular net spreads from the boundary of triangulated field to untreated field, and finally covers the whole surface. This algorithm can apply to the scattered data points on open surfaces, simple close surfaces and multiple connected close surfaces. The experimental results show that this algorithm can satisfy foundation for the surface reconstruction in the next step.
出处
《软件学报》
EI
CSCD
北大核心
2002年第4期659-663,共5页
Journal of Software
基金
国家863高科技发展计划资助项目(863-511-942-007)
