摘要
提出一种在 3D空间直接对曲面离散数据点进行三角网格划分的算法 ,该方法适用于非封闭曲面、封闭曲面及多连通复杂曲面的离散点集 ,同时也能处理剪裁曲面的离散点集 ,得到优良的三角网格。在引入边界环融合的概念的基础上 ,详细阐述算法如何实现对剪裁曲面离散点集三角划分 。
This paper brings forward a 3D triangulation algorithm for scattered data points which is adapted to any unclose surface, close surface and multiple connected surface. At the same time, the algorithm can also triangulate the scattered data points of trimmed surface and gain the perfect triangle net. This paper expatiates on how the algorithm actualizes triangulation on scattered data points of trimmed surface, based on the concept of Boundary Loop Syncretizing, and some examples of the practical applications are given.
出处
《计算机应用》
CSCD
北大核心
2001年第9期18-19,共2页
journal of Computer Applications
关键词
剪裁曲面
离散点集
3D三角划分
算法
CAD
reverse engineering
freeform surfaces
scattered data points
3D triangulation
boundary edge
boundary loop