散乱点云的三角划分算法研究  

An Algorithm Research of Triangulation for Scattered Points

作　　者：黄淼[1] 张海朝[1] 

机构地区：[1]河南科技大学电子信息工程学院,洛阳471003

出　　处：《微计算机应用》2007年第10期1039-1042,共4页Microcomputer Applications

基　　金：洛阳市科技攻关计划项目(0701041A)

摘　　要：通过对当前的三角网格划分方法进行比较分析,提出了一种散乱点云的3D三角网格划分算法。该算法不需如同二维划分方法那样要对散乱点云对应的自由曲面分片投影,而是直接在3D空间,根据离散点集所对应的曲面形态变化,利用网格扩展、边界环分裂和边界环封闭,逐层收缩生成三角网格。该算法能方便地处理空间多种曲面的散乱点云数据,并且生成的三角网格形态优良,布局合理。After analysising and comparing the current triangular mesh methods, presents a 3D scattered data points triangular mesh al- gorithm. The algorithm does not have to be similar to the two - dimensional division method that have to need lamination projection for free curved surface that corresponds scattered points, but directly in 3D space, according to a scattered points corresponding to the surface shape changing, using mesh expansion , boundary ring splitting and boundary ring closed , generating triangular mesh by contracting every layer. The algorithm can easily handle a variety of scattered points in surface space and the triangular mesh shaped fine, and the layout is reasonable.

关 键 词：离散点集 三角划分 网格扩展 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]