期刊文献+

基于包围盒细分的碰撞干涉检查算法研究 被引量:1

Research on Collision Detection Algorithm based on Bounding Volume Subdivision
在线阅读 下载PDF
导出
摘要 提出了一种基于轻量化三维模型的碰撞干涉检查算法.本算法只需要获得某时刻三维模型信息中的三角片顶点位置信息,就可以采用包围盒和判断空间三角形相交结合的方法完成轻量化三维模型的碰撞干涉检查.检查过程根据轻模型的三角片顶点信息构造包围盒,并对包围盒做分割处理,组织成八叉树结构,再进行这些分割后的包围盒的碰撞干涉检查,对发生干涉的叶节点包围盒则再对其中包含的三角面进行相交判断,若相交则说明发生了碰撞干涉.算法已得到初步应用,极大缩短了由大量三角面片构成的轻模型的碰撞干涉检查时间,而且提高了检查的效率和精度. This paper proposes a algorithm which is based on lightweight model to detect the model collision. The algorithm needs only to obtain the triangle vertex posi tion information of lightweight model at some time, and uti lizes the bounding box and the space triangle intersect detec tion method to complete the collision detection of lightweight model. The process of detect is to creat bounding box by the triangle vertex position information at first, then split the bounding box to 8 smaller bounding boxes, creat octree to save the data, and detect those smaller bounding box wheth er collision. Choose the collide boxes, obtain the triangle vertex position information in those collide boxes. If the space triangles are intersect, the lightweight models are col lide. The algorithm has been applied, it is greatly shorten the eollision detect time of lightweight models which is made by a large number of triangular facets, and improve the effi ciency, accuracy of the detection.
出处 《成组技术与生产现代化》 2012年第3期26-30,共5页 Group Technology & Production Modernization
关键词 碰撞干涉检查 轻量化 包围盒 包围盒树 三维空间三角形相交测试 collision detect lightweight bounding box octree space triangle intersect detection
  • 相关文献

参考文献8

  • 1Gottschalk S, Lin M, Manocha D. OBB--Tree: A Hierarchical Structure for Rapid Interference Detection[C]. The Proceedings of ACM SIGGRAPH'96, 1996 : 171 -- 180.
  • 2Gvan den Bergen. A fast and Robust GJK implementation for collision detection for convex objects[J]. Journal of Graphics tools, 1997, 4(2) :35--48.
  • 3Lin M C, Canny J F. A fast algorithm for incremental distance calculation[C]. In: Proceedings of the IEEE International Conference on Robotics and Automation, Sacramento, CA, 1991 :1008-- 1014.
  • 4Cameron S. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra[C]. In: Proc IEEE International Conference on Roboties and Automation, 1997: 3112--3117.
  • 5Katauaki Kawachi, Hiromasa Suzuki. Distance Computation between Non--convex Polyhedra at Short Range Based on Discrete Voronoi Regions[C]. In Hong Kong:Geometric Modeling and Processing 2000 (Theory and Applications), 2000: 123 -128.
  • 6Hubbard P M. Collision Detection for Interactive GraphicsApplication[J]. IEEE Transactions on Visualization and Corn puter Graphics, 1995, 1(3):218- 230.
  • 7James T Klosowski, Martin Held, Joseph S B Mitchell. Efficient collision detection using bounding volume hierarchies of k --DOPs[J]. IEEE Transaction on Visualization and Compuler Graphics, 1998,4(1) :21--37.
  • 8张宇,马丽红,余英林.空间模型碰撞检测的向量符号分析方法与实现[J].中国图象图形学报(A辑),1998,3(6):481-484. 被引量:10

二级参考文献3

  • 1Pavlidis Theo.计算机图形显示和图象处理的算法.吴成柯译,北京:科学出版社,1987年.
  • 2Yoram Baram. Detecting Collision from Gray level Expansion by a Neural Network, IEEE ICNNSP, 1995,449-453.
  • 3Fisher Scott S. Virtual Environments: Personal Simulations and Telepcesence in Virtual Reality,Helsel S K and Roth T P, eds,London:Mechler Ed, 1991.

共引文献9

同被引文献7

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部