| 基于层次包围盒的碰撞检测算法的存储优化 |
| |
| 引用本文： | 金汉均,王晓荣,王 萌.基于层次包围盒的碰撞检测算法的存储优化[J].计算机工程与应用,2007,43(16):61-63. |
| |
| 作者姓名： | 金汉均 王晓荣 王 萌 |
| |
| 作者单位： | [1]华中师范大学计算机科学系,武汉430079 [2]广西工学院计算机工程系,广西柳州545006 |
| |
| 摘 要： | 介绍了基于层次包围盒的碰撞检测算法的存储优化方法。该方法从存储空间的角度来改进基于AABB树的碰撞检测算法。根据AABB树的构造过程,减少内部节点的AABB包围盒的存储字节数;基于快速三角形相交测试算法,从叶节点结构里去掉包围盒信息,将叶节点从存储结构中删除。实验表明,利用AABB包围盒和叶节点的存储优化,既减少了算法的存储空间又加快了算法的执行时间。
|
| 关 键 词： | AABB包围盒 存储优化 重叠测试 碰撞检测 |
| 文章编号： | 1002-8331（2007）16-0061-03 |
| 修稿时间： | 2006-10 |
Memory-optimized of collision detection algorithm based on bounding-volume hierarchies |
| |
| JIN Han-jun,WANG Xiao-rong,WANG Meng.Memory-optimized of collision detection algorithm based on bounding-volume hierarchies[J].Computer Engineering and Applications,2007,43(16):61-63. |
| |
| Authors: | JIN Han-jun WANG Xiao-rong WANG Meng |
| |
| Affiliation: | 1.Department of Computer Science,Huazhong Normal University,Wuhan 430079, China ;2.Department of Computer Engineering,Guangxi University of Technology, Liuzhou, Guangxi 545006, China |
| |
| Abstract: | A method of memory-optimized is presented for collision detection algorithm based on bounding-volume.Collision detection algorithm based on AABB tree is improved from a space perspective.From the constructing process of AABB tree,the amount of byte of AABB bounding-volume for internal node is reduced.We wipe the bounding-volume out from leaf nodes struc- ture based on a fast triangle-triangle intersection test algorithm,and then wipe the leaf nodes out.We optimize the storage of AABB bounding-volume and leaf node at the same time.The direct result is that it can save a large amount of space and speed up the algorithm. |
| |
| Keywords: | AA BB bounding-volume memory-optimized intersection test collision detection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
