三角网格曲面模型快速分层算法  

Fast slicing algorithm for triangular mesh model

作　　者：孙殿柱[1] 朱昌志[1] 李延瑞[1] 

机构地区：[1]山东理工大学机械工程学院,淄博255091

出　　处：《北京航空航天大学学报》2010年第3期279-282,共4页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家863计划资助项目(2006AA04Z105)

摘　　要：提出一种三角网格曲面模型快速分层算法,该算法基于R*-tree建立三角网格动态空间索引结构,依据索引结构数据结点的分布状况计算各层截平面的位置;采用深度优先遍历方法获取与截平面相交的三角面片集合,并计算该集合中各面片与截平面的交线,将交线首尾相连,生成截面轮廓线,实现三角网格曲面模型的快速分层;实例证明该算法可对各种复杂三角网格曲面模型进行分层,算法准确、稳定,运行效率高.A fast slicing algorithm for triangular mesh model was proposed.The node splitting algorithm and the clustering algorithm of R＊-tree were improved and the spacial index structure of triangular mesh model was established based on the improved R＊-tree.The position of slice planes was computed according to data nodes＇ distributing of the spacial index structure,thus the distribution of slice planes was intensive in the cragged region of triangular mesh,and the distribution of slice planes was sparse in the smooth region of triangular mesh.The intersection triangular facets with slice plane were obtained with depth-first traversal algorithm of R＊-tree.The intersection line segments between slice plane and interection triangular facets were computed and they were sorted end to end,then the orderly section contour lines were obtained.It was proved that this algorithm can obtain section contour line accurately,effectively and has strong adaptability of triangular mesh model.

关 键 词：三角网格曲面模型 R＊-tree 深度优先遍历 截面轮廓线 快速分层 

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