3D游戏开发中的碰撞检测算法研究

碰撞检测在三维游戏开发中是必不可少的环节.目前,主流游戏引擎大多采用基于层次包围体的碰撞检测算法,其基本思想是用一个相对简单的包围体逼近场景中复杂的物体.文中对当前三维游戏开发中常用的四种基于包围体的算法作了理论分析,并通过试验对四种不同的包围体算法作了性能测试.试验结果表明,紧密性越好的包围体其精度越高,但时间消耗也高.因此,在具体的游戏开发中,应根据实际游戏的特殊情况进行算法选用,才能取得较好的效果.     

三维场景漫游中碰撞检测的研究与应用

在虚拟现实环境下,基于包围盒算法是一类重要碰撞检测算法,该文在比较了层次包围盒下的几种常用的包围盒技术,具体阐述了实时性好且较容易程序实现的轴一致包围盒(AABB)的定义、重叠测试和碰撞检测算法,并把该包围盒技术应用到虚拟现实系统的碰撞检测过程中,最终在VC++和OpenGL平台上实现了三维场景漫游过程中物体之间的精确碰撞检测。     

Android手持设备游戏中的碰撞检测算法研究

针对Android手持终端中复杂游戏场景的碰撞检测需求,提出了一种基于包围球和AABB的实时碰撞检测算法。该算法针对不同的虚拟对象构建不同的包围盒,并将改进后的包围盒投影排序分组方法应用其中。将该算法与使用包围盒投影排序分组方法的包围球算法与AABB算法比较,实验表明,该算法在保持更高精度的前提下仍能满足复杂场景中实时碰撞检测的要求。     

自定义的AABB碰撞检测算法

针对Vega中现有碰撞检测算法存在逼真度不足的现象,基于Segment类型的碰撞检测体,提出了一种自定义的AABB碰撞检测算法。通过定义12个Segment类型的碰撞检测体,构造出一个包围运动体的AABB盒,实现该运动体对场景的较为精确的碰撞检测。在该AABB盒的每条边的碰撞响应函数里面进行碰撞结果处理,提出了一种基于运动体的碰撞响应算法,用以提高视景仿真的逼真度。     

基于包围盒的碰撞检测算法研究

基于包围盒的碰撞检测算法是一类重要的碰撞检测算法。文章比较了几种常用的包围盒碰撞检测算法;给出了OBB包围盒的计算算法及其改进和修正算法;包围盒树的建立算法;包围盒的重叠测试和基于包围盒的碰撞检测算法;最后以OBB验证了该类算法的有效性,正确性和鲁棒性。     

一种利用Delaunay 三角剖分的碰撞检测算法

虚拟现实中物体对象分布及运动情况呈现复杂多样,碰撞检测算法很难达到实时 性和准确性的要求。提出了一种基于Delaunay 三角剖分的多物体碰撞检测实时算法。该算法运 用包围体紧密拟合物体对象,以包围体的中心构建离散数据点集,生成Delaunay 三角网格,实 施碰撞检测,避免层次包围盒和空间划分的不利因素,物体的更新等操作限定在局部的三角形 内。实验表明在多物体的碰撞检测中,即使存在若干移动物体,算法能够满足实时性和准确性 的要求。     

融合神经网络的布料碰撞检测算法

目的 针对当前在虚拟环境中布料柔体碰撞检测效率慢和准确性低的问题,提出一种根节点双层包围盒树结构和融合OpenNN （open neural networks library）神经网络加速预测碰撞检测的算法。方法 首先改进了碰撞检测常用的包围盒技术,提出根节点双层包围盒算法,减少包围盒的构造时间。其次使用神经网络优化碰撞检测技术,利用神经网络可以处理大量数据的优势,每次可以检测大量基本图元是否发生碰撞,解决了碰撞检测计算复杂性高的问题。最后准确地找到碰撞粒子并做出碰撞响应。结果 在相同的复杂布料模型情况下,根节点双层包围盒算法在运行速度上比传统混合包围盒算法快,耗时缩减了5.51%~11.32%。基于OpenNN算法的总耗时比根节点双层包围盒缩减了11.70%,比融合DNN （deep neural network）的自碰撞检测算法减少了6.62%。随着碰撞检测难度的增大,当布料模型的精度增加84%时,传统物理碰撞检测方法用时增加96%,融合DNN的自碰撞检测算法用时增加90.11%,而本文基于神经网络的算法用时仅增加了68.37%,同时表现出更高的稳定性,满足使用者对实时性的要求。结论 对于模拟场景中简单模型的碰撞,本文提出的根节点双层包围盒算法比传统的包围盒方法耗时短。对于复杂模型,基于OpenNN神经网络的碰撞检测算法在效率上优于传统的包围盒算法和融合DNN的自碰撞检查算法,而且模拟效果的准确性也得以保证,是一种高效的碰撞检测方法。     

虚拟现实技术中碰撞检测算法研究

碰撞检测是虚拟现实技术、机器人技术与动画仿真技术等领域中一个关键的环节,其基本任务是确定两个或多个物体彼此之间是否发生接触或穿透。本文阐述了碰撞检测的一般结构、常见的几种分类标准。重点介绍了目前最主要的三种碰撞检测算法,基于包围盒方法的碰撞检测算法,基于图像空间的碰撞检测算法,基于距离场的碰撞检测算法,对它们各自的优缺点做了比较分析。最后预测了碰撞检测算法的未来发展方向。     

改进的基于AABB包围盒的碰撞检测算法

介绍了一种改进的基于AABB包围盒的碰撞检测算法,通过对对象不断的分割逐步构造出贴近对象的层次包围盒,在碰撞检测阶段对其逐层遍历以实现精确而快速的碰撞检测.实验结果表明,与层次包围球算法相比,该方法在构造二叉树和进行精确的碰撞检测时,性能都有较为明显的提高.     

基于骨骼的3D角色的碰撞检测

基于骨骼的角色实现快速碰撞检测。该算法以层次包围盒（OBB）为基础,通过为每个骨骼模型建立包围盒,运用分离轴理论计算包围盒的相交测试。该方法能有效地用于3D游戏引擎中碰撞检测的实现。     

基于层次包围盒的碰撞检测算法的存储优化

介绍了基于层次包围盒的碰撞检测算法的存储优化方法。该方法从存储空间的角度来改进基于AABB树的碰撞检测算法。根据AABB树的构造过程,减少内部节点的AABB包围盒的存储字节数;基于快速三角形相交测试算法,从叶节点结构里去掉包围盒信息,将叶节点从存储结构中删除。实验表明,利用AABB包围盒和叶节点的存储优化,既减少了算法的存储空间又加快了算法的执行时间。     

Efficient collision detection using bounding volume hierarchies ofk-DOPs

Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment. In addition to determining accurately the contacts that occur between pairs of objects, one needs also to do so at real-time rates. Applications such as haptic force feedback can require over 1000 collision queries per second. We develop and analyze a method, based on bounding-volume hierarchies, for efficient collision detection for objects moving within highly complex environments. Our choice of bounding volume is to use a discrete orientation polytope (k-DOP), a convex polytope whose facets are determined by halfspaces whose outward normals come from a small fixed set of k orientations. We compare a variety of methods for constructing hierarchies (BV-trees) of bounding k-DOPs. Further, we propose algorithms for maintaining an effective BV-tree of k-DOPs for moving objects, as they rotate, and for performing fast collision detection using BV-trees of the moving objects and of the environment. Our algorithms have been implemented and tested. We provide experimental evidence showing that our approach yields substantially faster collision detection than previous methods     

Partitioning and Handling Massive Models for Interactive Collision Detection

We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to interactive data access and processing in a large geometric database, which may not fit into main memory of typical desktop workstations or computers. We present a new algorithm using overlap graphs for localizing the "regions of interest" within a massive model, thereby reducing runtime memory requirements. The overlap graph is computed off-line, pre-processed using graph partitioning algorithms, and modified on the fly as needed. At run time, we traverse localized sub-graphs to check the corresponding geometry for proximity and pre-fetch geometry and auxiliary data structures. To perform interactive proximity queries, we use bounding-volume hierarchies and take advantage of spatial and temporal coherence. Based on the proposed algorithms, we have developed a system called IMMPACT and used it for interaction with a CAD model of a power plant consisting of over 15 million triangles. We are able to perform a number of proximity queries in real-time on such a model. In terms of model complexity and application to large models, we have improved the performance of interactive collision detection and proximity computation algorithms by an order of magnitude.     

基于AABB树的碰撞检测算法的内存优化

介绍了从存储空间角度来改进基于AABB树的碰撞检测算法的方法.根据有关三角形间快速相交测试算法和三角形与包围盒间的快速相交测试算法,略过包围盒间的相交测试,从叶节点结构里去掉包围盒信息,将叶节点从存储结构中删除.对一棵含有N个节点的 AABB 树而言,可以节约一半节点的内存空间.实验表明,利用 AABB 树叶节点的内存优化,减少了算法所需的内存空间且加快了算法的执行时间.     

虚拟装配环境中碰撞检测算法的研究综述与展望

虚拟装配系统可对机电产品进行装配仿真,生成装配顺序与装配轨迹,而碰撞检测技术正是对装配顺序与装配轨迹的正确性进行验证。把虚拟装配环境的碰撞检测算法归类为:基于时间域的碰撞检测算法、基于几何空间的碰撞检测算法、基于图像空间的碰撞检测算法。对这几类算法的研究现状进行了综述,根据研究现状分析了碰撞检测算法中存在的问题及研究难点,并对碰撞检测算法的研究趋势进行了展望。     

RECODE: an image‐based collision detection algorithm

Object interactions are ubiquitous in interactive computer graphics, 3D object motion simulations, virtual reality and robotics applications. Most collision detection algorithms are based on geometrical object‐space interference tests. Some algorithms have employed an image‐space approach to the collision detection problem. In this paper we demonstrate an image‐space collision detection process that allows substantial computational savings during the image‐space interference test. This approach makes efficient use of the graphics rendering hardware for real‐time complex object interactions. Copyright © 1999 John Wiley & Sons, Ltd.     

Comparative investigation of GPU-accelerated triangle-triangle intersection algorithms for collision detection

Efficient collision detection is critical in 3D geometric modeling. In this paper, we first implement three parallel triangle-triangle intersection algorithms on a GPU and then compare the computational efficiency of these three GPU-accelerated parallel triangle-triangle intersection algorithms in an application that detects collisions between triangulated models. The presented GPU-based parallel collision detection method for triangulated models has two stages: first, we propose a straightforward and efficient parallel approach to reduce the number of potentially intersecting triangle pairs based on AABBs, and second, we conduct intersection tests with the remaining triangle pairs in parallel based on three triangle-triangle intersection algorithms, i.e., the Möller’s algorithm, Devillers’ and Guigue’s algorithm, and Shen’s algorithm. To evaluate the performance of the presented GPU-based parallel collision detection method for triangulated models, we conduct four groups of benchmarks. The experimental results show the following: (1) the time required to detect collisions for the triangulated model consisting of approximately 1.5 billion triangle pairs is less than 0.5 s; (2) the GPU-based parallel collision detection method speedup over the corresponding serial version is 50x - 60x, and (3) Devillers’ and Guigue’s algorithm is comparatively and comprehensively the best of the three GPU-based parallel triangle-triangle intersection algorithms. The presented GPU-accelerated method is capable of efficiently detecting the potential collisions of triangulated models. Overall, the GPU-accelerated parallel Devillers’ and Guigue’s triangle-triangle intersection algorithm is recommended when performing practical collision detections between large triangulated models.

     

虚拟场景漫游系统的碰撞检测优化算法

基于三维层面的碰撞检测算法都比较复杂,还需要大量场景数据作支撑.本文针对虚拟场景漫游系统的特点,提出一种将三维碰撞简化到二维平面中的检测算法.实践表明:该算法能大大提高检测效率,也能很好地满足漫游系统的需要.     

基于包围盒的碰撞检测算法研究

碰撞检测问题在机器人运动规划、计算机图形学等领域中有很长的研究历史,近年来随着虚拟现实、分布交互仿真等技术的兴起,碰撞检测问题开始成为研究的热点.目前存在许多碰撞检测算法,它们各有优劣.该文主要介绍了基于包围盒的各种碰撞检测算法,并对这几种包围盒算法进行比较,最后基于时空相关性的分析,提出改进的方法来提升算法的效率.