节点文献
基于层次包围盒的碰撞检测算法的存储优化
Memory-optimized of collision detection algorithm based on bounding-volume hierarchies
【摘要】 介绍了基于层次包围盒的碰撞检测算法的存储优化方法。该方法从存储空间的角度来改进基于AABB树的碰撞检测算法。根据AABB树的构造过程,减少内部节点的AABB包围盒的存储字节数;基于快速三角形相交测试算法,从叶节点结构里去掉包围盒信息,将叶节点从存储结构中删除。实验表明,利用AABB包围盒和叶节点的存储优化,既减少了算法的存储空间又加快了算法的执行时间。
【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 structure 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.
【Key words】 AABB bounding-volume; memory-optimized; intersection test; collision detection;
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2007年16期
- 【分类号】TP391.9
- 【被引频次】16
- 【下载频次】288