三角网格模型的自动分割算法  

Auto-partition Algorithm for Triangular Mesh Model

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

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

出　　处：《北京工业大学学报》2010年第11期1447-1450,共4页Journal of Beijing University of Technology

基　　金：国家自然科学基金资助项目(51075247)

摘　　要：提出了一种根据设计意图的三角网格模型自动分割算法,该算法采用R*-tree(recangle*-tree)建立三角网格空间索引结构.基于该结构,采用深度优先遍历方法快速准确地查询与分割面相交的三角面片,对相交三角面片进行分割并重新剖分,实现了三角网格模型不受曲率等条件限制的自动分割.实例表明:该算法可对各种复杂型面三角网格进行分割,算法运行效率高,且能有效避免分割区域的锯齿现象.A fast auto-partition algorithm according to designing meaning for a triangular mesh model, which has four steps, is proposed. First, the spacial index structure of the triangular mesh model is established based on the R^＊ -tree. Second, the intersectant triangles are obtained with depth-first traversing based on the special index structure. Third, the intersectant triangles are subdivided to get after-partition model without sawtooth, which is proved to be able to partite all types of triangular areas. mesh models efficiently, and can avoid sawtooth inpartition areas.

关 键 词：三角网格模型 R＊-树(R＊-tree) 深度优先遍历 自动分割 

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