北京航空航天大学学报 ›› 2010, Vol. 36 ›› Issue (3): 279-282.

• 论文 • 上一篇    下一篇

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

孙殿柱, 朱昌志, 李延瑞   

  1. 山东理工大学 机械工程学院, 淄博 255091
  • 收稿日期:2009-02-27 出版日期:2010-03-31 发布日期:2010-09-13
  • 作者简介:孙殿柱(1956-),男,山东烟台人,教授,zhuchzhi@126.com.
  • 基金资助:

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

Fast slicing algorithm for triangular mesh model

Sun Dianzhu, Zhu Changzhi, Li Yanrui   

  1. School of Mechanical Engineering, Shandong University of Technology, Zibo 255091, China
  • Received:2009-02-27 Online:2010-03-31 Published:2010-09-13

摘要: 提出一种三角网格曲面模型快速分层算法,该算法基于R*-tree建立三角网格动态空间索引结构,依据索引结构数据结点的分布状况计算各层截平面的位置;采用深度优先遍历方法获取与截平面相交的三角面片集合,并计算该集合中各面片与截平面的交线,将交线首尾相连,生成截面轮廓线,实现三角网格曲面模型的快速分层;实例证明该算法可对各种复杂三角网格曲面模型进行分层,算法准确、稳定,运行效率高.

Abstract: 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.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发