摘要
提出了一种根据设计意图的三角网格模型自动分割算法,该算法采用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.
出处
《北京工业大学学报》
EI
CAS
CSCD
北大核心
2010年第11期1447-1450,共4页
Journal of Beijing University of Technology
基金
国家自然科学基金资助项目(51075247)
