期刊文献+

基于八叉树精确划分型值点的碰撞检测算法 被引量:4

The algorithm of collision detection based on octrees of data points
下载PDF
导出
摘要 针对虚拟现实中碰撞检测的快速计算问题,提出一种新的粗略碰撞检测与精确碰撞检测相结合的检测算法。首先利用AABB包围盒法排除不可能相交的物体,然后对可能发生碰撞的包围盒采用八叉树算法进行空间分割,在包围盒内找到由型值点形成的三角形面片,利用三角形面片的碰撞检测算法精确地判断物体是否碰撞。通过与OBB包围盒算法的碰撞检测数据对比,验证了该方法的有效性。 A hierarchical collision detection algorithm from coarse detection to fine detection was established in the paper. Fimtly, bounding volumes which are not intersected clearly will be removed rapidly by AABB intersection test. Secondly, divide bounding volumes whieh are intersected by octree division method and find out data points. Generate lines between data points and then constitute the triangle faces. Lastly, the algorithm detects intersection between two triangles from two objects. After testing and comparison with OBB collision detection algorithm, the efficiency of the algorithm is greatly improved.
出处 《微型机与应用》 2013年第20期80-82,90,共4页 Microcomputer & Its Applications
关键词 碰撞检测 AABB包围盒 八叉树 型值点 三角形面片 collision detection AABB octree data point triangle faces
  • 相关文献

参考文献5

  • 1王志强,洪嘉振,杨辉.碰撞检测问题研究综述[J].软件学报,1999,10(5):545-551. 被引量:151
  • 2刘晓平,翁晓毅,陈皓,曹力.运用改进的八叉树算法实现精确碰撞检测[J].计算机辅助设计与图形学学报,2005,17(12):2631-2635. 被引量:24
  • 3陈怀友,张天驰,张菁.虚拟现实技术[M].北京:清华大学出版社,2012.
  • 4QIN H,TERZOPOULOS D.Triangular NURBS and their dynamic generalizations[J].Computer Aided Geometri Design 1997 , 14(4) : 325-347.
  • 5WELCH W,WITKIN A.Free-form shape design using triangulated surfaces[C].Computer Graphics Proceedings, Annual Conference Series.New York : 1994 : 247-256.

二级参考文献22

  • 1覃中平,张焕国,高翔.多边形旋转时的可移动性[J].计算机学报,1994,17(1):52-57. 被引量:7
  • 2覃中平,张焕国.多边形的方向与圆弧可视性[J].计算机学报,1994,17(4):257-263. 被引量:9
  • 3覃中平,张焕国.平面内多边形沿曲线定姿态刚体移动时的碰撞判定算法[J].计算机学报,1997,20(6):567-572. 被引量:5
  • 4李辉.凸多边形可移动性的最优判别算法[J].中国科学:A辑,1987,17(12):1301-1308.
  • 5李辉,中国科学.A,1987年,17卷,12期,1301页
  • 6Wang W P,IEEE Comput Graph Appl,1986年,6卷,12期,8页
  • 7Chin F,IEEE Trans Comput,1983年,32卷,12期,1203页
  • 8Jimenez P, Thomas F, Torras C. 3D collision detection: A survey [J] . Computers & Graphics, 2001, 25(2): 269~285.
  • 9Jackins C L, Tanimoto S L. Octree and their use in representing three-dimensional objects [J]. Computers & Graphics, 1980,14(3): 249~270.
  • 10Gargantini I. Linear octrees for fast processing of three-dimensional objects [J]. Computers & Graphics, 1982, 20(4):365 ~ 374.

共引文献177

同被引文献35

  • 1秦铨,赵春江,肖伯祥,郭新宇.基于AABB-OBB盒的玉米叶片碰撞检测[J].农机化研究,2012,34(1):177-180. 被引量:4
  • 2Avril Q, Gouranton V, Arnaldi B. Dynamic adapta- tion of broad phase collision detection algorithms [C] // IEEE International Symposium on Virtual Reality Innovation. Singapore: IEEE Computer Society Pub- lishing, 2011:41-47.
  • 3Zhao W, Li L. A new K-DOPs collision detection al- gorithms improved by GA [C]// lth International Conference on Wireless Communications and Applica- tions. Sanya: Springer Verlag Publishing, 2012: 58- 68.
  • 4Anderson M, Ronan B, Daniel T. Efficient collision detection with in deforming spherical sliding contact [J]. IEEE Transactions on Visualization and Computer Graphics, 2007,13(3) : 518-529.
  • 5Spillmann J, Becket M, Teschner M. Efficient up- dates of bounding sphere hierarchies for geometrically deformable models [J]. Journal of Visual Communica- tion and Image Representation, 2007,18 ( 2 ) : 101-108.
  • 6Luque R, Comba J, Freitas C. Broad-phase coIIision detection using semi-adjusting BSP-trees [C]//Sym- posium on Interactive 3D Graphics and Games. Wash- ington: Association for Computing Machinery Pub- lishing, 2005 : 179-186.
  • 7Naylor B F. Interactive solid geometry via partitioning trees [C]//in Graphics Interface. Toronto : Canadian In- formation Processing Publishing, 1992 : 11-18.
  • 8Bentley J L, Friedman J H. Data structures for range searching [J]. Computing surveys, 1979,11 (4) : 397- 409.
  • 9Wong T H, Leach G, Zambetta F. Virtual subdivi- sion for GPU based collision detection of deformable objects using a uniform grid [J]. Visual Computer, 2012, 28:829-838.
  • 10Fujimotoa K, Kimuraa N, Moriyaa T. Method for fast detecting the intersection of a plane and a cube in an octree structure to find point sets within a convex region Intelligent Robots and Computer Vision [C]// Algorithms and Techniques, Burlingame. Burlingame.. SPIE Publishing, 2012 : 1-10.

引证文献4

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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