一种改进的不规则三角网格曲面切割算法  

Improved Partition Algorithm between Triangulated Irregular Network

作　　者：花卫华[1] 邓伟萍[2] 刘修国[1] 尚建嘎[1] 

机构地区：[1]中国地质大学信息工程学院 [2]湖北经济学院计算机科学学院,湖北武汉430000

出　　处：《地球科学（中国地质大学学报）》2006年第5期619-623,共5页Earth Science-Journal of China University of Geosciences

基　　金：国家大型"863"计划:面向网络海量空间信息的大型GIS(No .2002AA135140)

摘　　要：三角网切割是实现三维地质建模和模型分析的关键算法,它的效率直接决定了建模算法的效率.通过建立三角网的方向包围盒(oriented bounding box,OBB)树实现曲面间的碰撞检测,然后对发生相交的三角形对统一计算交点,通过对顶点坐标归一化完成曲面切割后的快速重构,并针对不同的曲面类型采用不同的切割分类方法进行2侧切割结果的划分.阐述了算法的实现过程并展示了切割后的图形效果.The partition algorithms between triangulated irregular network are key algorithms for building and analyzing 3D geology models. Their efficiency determines the model building efficiency. To improve the algorithm, this paper first realizes collision detection by building OBB （oriented-bounding box） trees, and then calculates the intersection points of cutting triangle pairs. Through normalizing the vertex coordinates, the algorithm provides a method for the rapid reconstruction of the geology model. The algorithm uses different partition methods based on different partition types. This paper gives a detailed description of the algorithm＇s process and demonstrates a cut effect of triangulated irregular network.

关 键 词：TIN 相交 OBBT 归一化 分边 投影 

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