期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于AABB树的碰撞检测算法的内存优化 被引量：3

Memory-optimized of collision detection algorithm based on AABB tree
下载PDF
导出
摘要 介绍了从存储空间角度来改进基于AABB树的碰撞检测算法的方法。根据有关三角形间快速相交测试算法和三角形与包围盒间的快速相交测试算法,略过包围盒间的相交测试,从叶节点结构里去掉包围盒信息,将叶节点从存储结构中删除。对一棵含有N个节点的AABB树而言,可以节约一半节点的内存空间。实验表明,利用AABB树叶节点的内存优化,减少了算法所需的内存空间且加快了算法的执行时间。 A method of improving collision detection algorithm based on AABB tree is presented from a space perspective. We wipe the bounding-volume out from leaf nodes structure based on a fast triangle-triangle intersection test algorithm, and then wipe the leaf nodes out. The storage of leaf node of AABB tree is optimized. For an AABB tree with n nodes, memory space ofhalfofn nodes can be saved. The experiment indicates it can save a large amount of memory space and speed up the algorithm by optimizing leaf nodes.
作者 王晓荣 金汉均 王萌
机构地区 广西工学院计算机工程系 华中师范大学计算机科学系
出处 《计算机工程与设计》 CSCD 北大核心 2008年第1期256-258,共3页 Computer Engineering and Design
基金 广西科学基金项目(桂科自0481016、0640034) 广西工学院硕士基金项目
关键词 碰撞检测 AABB树 内存优化 相交测试 节点 collision detection AABB tree memory-optimized intersection test node
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献7

  • 1[1]Pierre Terdiman.Memory-optimized bounding-volume hierar-chies[EB/OL].http://www.codercomer.com/Opcode.htm,2001.
  • 2潘振宽,李建波.基于压缩的AABB树的碰撞检测算法[J].计算机科学,2005,32(2):213-215. 被引量：23
  • 3[2]Philip J Schneider,David H Eberly.计算机图形学几何工具算法详解[M].周长发,译.北京:电子工业出版社,2005.
  • 4[4]Moiler Tomas.Fast 3D triangle-box overlap testing[J].Journal of Graphics Tools,2002,6(1):29-33.
  • 5[5]Wan H G,Fan Z W,Gao S M,et al.A parallel collision detection al-gorithra based on hybrid bounding volume hierarchy[C].Kunming,China:Proceedings of CAD & Graphics,2001:521-528.
  • 6[6]Ehmann S A,Lin M C.Accelerated proximity queries between convex polyhedra ruing multi-level voronoi marching[C].Pro-ceedings IEEE IROS,2000.
  • 7[7]Jiménez P,Thomas F,Torras C.Collision detection:A survey[J].Computers and Graphics,2001,25(2):269-285.

二级参考文献11

  • 1Hubbard P M. Collision Detection for Interactive Graphics: [PHD Thesis]. Department of Computer Science, Brown University,March 1995.
  • 2Cohen J D,Lin M C,Manocha D,Ponamgi M. I-COLLIDE an interactive and exact collision detection system for large-scale environments. Symposium on Interactive 3D graphics,Monterey,CA USA,1995. 189～196.
  • 3Moore M,Wilhelms J. Collision Detection and Response for Computer Animation. ACM Computer Graphics (Proc. of SIGGRAPH ‘88) ,1988,22(4) :289～298.
  • 4Naylor B,Amatodes J A,Thibault W. Merging BSP Trees Yields Polyhedral Set Operation. ACM Computer Graphics (Proc. of Siggraph'90) ,1990,24(4): 115～124.
  • 5Held M,Klosowski J T,Mitchell J S B. Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs. In:Proc. Seventh Canadian Conf. on Computational Geometry, 1995,2:205～210.
  • 6Hubbard P M. Approximating Polyhedra with Spheres for TimeCritical Collision Detection. ACM Transaction on Graphics,1996,15(3).
  • 7Gottschalk S,Lin M C,Manocha D. OBBTrees: A Hierarchical Structure for Rapid Interference Detection. ACM Computer Graphics(Proc. of SIGGRAPH' 96) ,1996. 171～180.
  • 8Klosowski J T,et al. Efficient Collision Detection Using Bounding Volumes Hierarchical of k-DOPs. IEEE Transaction on Visualization and Computer Graphics, 1998,4(1): 21～36.
  • 9Smith A,Kitamura Y,Takemura H,Kishino F. A Simple and Effcient Method for Accurate Collision Detection Among Deformable Polyhedral Objects in Arbitrary Motion. In:Proc. of the IEEE Virtual Reality Annual Intl. Symposium,1995. 136～145.
  • 10van den Bergen G. Efficient Collision Detection of Complex Deformable Models using AABB Trees. Journal of Graphics Tools,1997,2(4): 1～14.

共引文献23

同被引文献19

引证文献3

二级引证文献22

计算机工程与设计
2008年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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