实现3D离散点优化三角划分的三维算法  

A NEW TRIANGULATION ALGORITHM FOR 3D SCATTERED POINTS

作　　者：柯映林[1] 周儒荣[1] 

机构地区：[1]浙江大学机械系,南京航空航天大学机械系

出　　处：《计算机辅助设计与图形学学报》1994年第4期241-248,共8页Journal of Computer-Aided Design & Computer Graphics

摘　　要：本文系统研究了３Ｄ离散数据的直接三角划分，并解决了与多值曲面相对应离散数据的分片三角划分问题。实现这一算法的关键是将这些与多值曲面相对应的离散数据按有关的特征线分解，慢之转化成较简单的问题分别进行处理。目前，这种分片三角划分算法已在Ｂｅｚｉｅｒ三角曲面插值中取得了良好的效果。By systematically discussing a direct triangulation for 3D points,a new separated triangulation algorithm for 3D data related to a multivalued surface is presented. The key problem of the new algorithm is to separate the 3D points effectively into several parts which correspond to some single-valued surface,and make a complicated problem be simplified. Now, these algorithms have been used in constructing triangular Bezier surface.Some practical applications have been obtained.

关 键 词：离散点 三角划分 曲面插值 算法 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]