混合包围盒碰撞检测算法研究

为提高碰撞检测的实时性,提出一种混合包围盒碰撞检测算法。将物体的包围盒二叉树设计为2层结构,顶层使用AABB包围盒排除不相交的物体,下层利用k-DOPs包围盒检测物体之间的碰撞情况。采用任务树的方法对2棵混合包围盒二叉树进行同步遍历,实现物体之间的碰撞检测。与其他碰撞检测算法进行对比分析,实验结果表明,该算法能提高碰撞检测的实时性和精确性。     

刚体在软体对象环境中的碰撞检测的研究

刚体在软体对象环境中的碰撞检测在虚拟现实的研究领域具有很大的普遍性 ,但以往的研究较少 .文中给出了一种基于固定方向凸包 (FDH)包围盒树的碰撞检测方法 ,并着重论述了利用线性规划的思想以解决刚体自由运动后包围盒树的更新以及通过一种自底向上的方法解决软体对象变形后包围盒树的更新 .实验表明 ,该方法不仅能较好地解决刚体间的碰撞检测 ,而且能有效地解决刚体与软体间的碰撞检测     

虚拟手术环境中软组织的快速碰撞检测

针对虚拟手术中软组织碰撞检测的实时性问题,提出了一种基于延迟更新策略的快速检测方法。该方法应用层次包围盒（BVH）的思想并根据拓扑结构特征来表示手术环境中的对象,同时使用延迟更新的策略来降低更新的计算量。首先用不同的层次包围盒来表示手术工具和手术对象;然后利用包围盒的相交测试快速排除不相交部分;再对可能发生碰撞的部分使用更为精确的三角面片相交测试来确定碰撞信息,最后使用延迟更新的策略来完成软组织变形时层次包围盒的更新。实验表明,该方法相较于现有算法在保持检测精度的同时能够有效提高碰撞检测的速度。     

gProximity: Hierarchical GPU‐based Operations for Collision and Distance Queries

We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many‐core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight‐fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swept spheres (RSS). We also describe efficient algorithms to compute a linear bounding volume hierarchy (LBVH) and update them using refitting methods. Moreover, we show that tight‐fitting bounding volume hierarchies offer improved performance on GPU‐like throughput architectures. We use our algorithms to perform discrete and continuous collision detection including self‐collisions, as well as separation distance computation between non‐overlapping models. In practice, our approach (gProximity) can perform these queries in a few milliseconds on a PC with NVIDIA GTX 285 card on models composed of tens or hundreds of thousands of triangles used in cloth simulation, surgical simulation, virtual prototyping and N‐body simulation. Moreover, we observe more than an order of magnitude performance improvement over prior GPU‐based algorithms.     

一种利用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的自碰撞检查算法,而且模拟效果的准确性也得以保证,是一种高效的碰撞检测方法。     

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

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

一种基于八叉树与流水线技术的快速碰撞检测算法

针对存在大量运动物体的虚拟环境,提出一种基于空间八叉树剖分与流水线技术的并行碰撞检测算法.通过八叉树剖分,把虚拟空间剖分成一系列的子空间,然后只对同一空间中的结点进行碰撞检测.对空间内的每个物体构建包围盒树,同一空间中的任意两棵包围盒树遍历构成任务树,把任务树中的任务分配给不同的进程进行碰撞检测,并采用流水线与多线程技...     

Collision Detection for Deformable Objects

Interactive environments for dynamically deforming objects play an important role in surgery simulation and entertainment technology. These environments require fast deformable models and very efficient collision handling techniques. While collision detection for rigid bodies is well investigated, collision detection for deformable objects introduces additional challenging problems. This paper focuses on these aspects and summarizes recent research in the area of deformable collision detection. Various approaches based on bounding volume hierarchies, distance fields and spatial partitioning are discussed. In addition, image‐space techniques and stochastic methods are considered. Applications in cloth modeling and surgical simulation are presented.     

A fast algebraic non-penetration filter for continuous collision detection

Continuous collision detection is a key technique to meet non-penetration requirements in many applications. Even though it is possible to perform efficient culling operations in the broad stage of a continuous collision detection algorithm, such as bounding volume hierarchies, a huge number of potentially colliding triangles still survive and go to the succeeding narrow stage. This heavily burdens the elementary collision tests in a collision detection algorithm and affects the performance of the entire pipeline, especially for fast moving or deforming objects. This paper presents a low-cost filtering algorithm using algebraic analysis techniques. It can significantly reduce the number of elementary collision tests that occur in the narrow stage. We analyze the root existence during the time interval [0, 1] for a standard cubic equation defining an elementary collision test. We demonstrate the efficiency of the algebraic filter in our experiments. Cubic-solvers augmented by our filtering algorithm are able to achieve up to 99% filtering ratios and more than 10 ×  performance improvement against the standard cubic-solver without any filters.     

基于时空相关性碰撞检测算法

在基于层次包围盒碰撞检测算法中,参与相交测试的包围盒的数目会直接影响到碰撞检测的速度.针对这一特点,利用虚拟环境中对象运动的时空相关性对包围盒树进行优化,通过跟踪上一时间点对包围盒树的遍历过程,确定当前时间点的遍历路径,从而有效地减少遍历过程中包围盒相交的次数.实验结果证明,算法能够有效地减少参与测试的包围盒数目,大大提高了碰撞检测的速度.     

结合轴对齐包围盒和空间划分的碰撞检测算法

目的 碰撞检测是虚拟现实,特别是虚拟装配中的关键技术。针对基于包围盒的碰撞检测算法的准确性和检测效率不足的问题,提出一种结合AABB轴对齐包围盒和空间划分的碰撞检测算法。方法 本文算法采用分步检测的方法,利用AABB算法来确定两包围盒的相交区域后,结合模型移动方向和运动趋势进行空间划分,利用碰撞检测的时空相关性,对时空相关的部分进行相交测试,通过将包围盒还原成三角面以及点的方式来保证检测的准确性。结果 本文算法与AABB层次包围盒二叉树算法、k-Dops包围盒算法以及BPS空间分割树算法进行对比实验分析。在碰撞的几何精度上,本文算法在大部分情况下与AABB算法和k-Dops算法的距离差超过阈值0.02,证明本文算法在碰撞几何精度上有明显的提高。在碰撞检测时耗上,随着碰撞检测难度的不断增加,本文算法在平移自由度下比AABB算法和BSP算法、在旋转自由度下比AABB算法和k-Dops算法的检测时间均降低了50%以上。在三角面数对算法碰撞检测时耗的影响上,当运动模型的三角面数较多时,本文算法表现出更高的稳定性。结论 结合AABB包围盒和空间划分方法的碰撞检测算法,在减少碰撞检测所需时间的同时提高了碰撞检测的准确性,可以满足虚拟装配技术中对碰撞检测算法准确性的要求,同时也能满足使用者实时性的交互习惯。     

包围盒碰撞检测算法的优化

围绕如何提高碰撞检测的速度,对虚拟环境中的物体进行了假设,提出了对碰撞检测进行预处理的方法,并结合各类包围盒的特点,提出了在碰撞检测中针对具有不同几何特征的物体选择不同类型包围盒的混合包围盒算法,分析了不同类型包围盒之间的求交算法,实现了层次包围盒碰撞检测算法的优化,提高了碰撞检测的速度,增强了系统的实时性。     

应急仿真中的碰撞检测算法研究

以应急仿真场景为背景,针对其中大量物体碰撞检测过程的需求,提出了层次包围盒与空间划分方法结合的实时碰撞检测算法,可以在完全不降低碰撞检测精度的同时,大大改进了仿真环境碰撞检测的效率,减轻了计算负担,提高了系统的实时性。     

一种新的基于混合层次包围盒的碰撞检测算法

为了实现物体间快速精确的碰撞检测,提出了一种新的基于混合层次包围盒的碰撞检测算法,充分利用了包围球计算简单和K-DOPs包围盒紧密性好的优点,来构建物体的混合层次包围盒结构。在包围盒树的上层采用Sphere包围盒,能快速排除不相交的物体,下层采用K-DOPs包围盒,进行更加精确的相交测试,提高了碰撞检测实时性。实验结果表明,该算法是有效可行的,具有较强的实时性及鲁棒性,性能优于传统碰撞检测算法。     

Generalization of the collision cone approach for motion safety in 3-D environments

Avoidance of collision between moving objects in a 3-D environment is fundamental to the problem of planning safe trajectories in dynamic environments. This problem appears in several diverse fields including robotics, air vehicles, underwater vehicles and computer animation. Most of the existing literature on collision prediction assumes objects to be modelled as spheres. While the conservative spherical bounding box is valid in many cases, in many other cases, where objects operate in close proximity, a less conservative approach, that allows objects to be modelled using analytic surfaces that closely mimic the shape of the object, is more desirable. In this paper, a collision cone approach (previously developed only for objects moving on a plane) is used to determine collision between objects, moving in 3-D space, whose shapes can be modelled by general quadric surfaces. Exact collision conditions for such quadric surfaces are obtained and used to derive dynamic inversion based avoidance strategies.     

ICCD: Interactive Continuous Collision Detection between Deformable Models Using Connectivity-Based Culling

We present an interactive algorithm for continuous collision detection between deformable models. We introduce multiple techniques to improve the culling efficiency and the overall performance of continuous collision detection. First, we present a novel formulation for continuous normal cones and use these normal cones to efficiently cull large regions of the mesh as part of self-collision tests. Second, we introduce the concept of “procedural representative triangles” to remove all redundant elementary tests between nonadjacent triangles. Finally, we exploit the mesh connectivity and introduce the concept of “orphan sets” to eliminate redundant elementary tests between adjacent triangle primitives. In practice, we can reduce the number of elementary tests by two orders of magnitude. These culling techniques have been combined with bounding volume hierarchies and can result in one order of magnitude performance improvement as compared to prior collision detection algorithms for deformable models. We highlight the performance of our algorithm on several benchmarks, including cloth simulations, N-body simulations, and breaking objects.     

基于深度纹理的实时碰撞检测算法

结合层次包围盒和基于图形硬件的方法,以带深度纹理的包围盒替代物体的几何模型,利用图形硬件在纹理映射时进行深度比较,以实现碰撞检测.实验结果表明,与CULLIDE算法相比,文中算法执行效率更高且执行时间固定,具有较高的实时性.     

Interactive continuous collision detection for non-convex polyhedra

We present a highly interactive, continuous collision detection algorithm for rigid, general polyhedra. Given initial and final configurations of a moving polyhedral model, our algorithm creates a continuous motion with constant translational and angular velocities, thereby interpolating the initial and final configurations of the model. Then, our algorithm reports whether the model under the interpolated motion collides with other rigid polyhedral models in environments, and if it does, the algorithm reports its first time of contact (TOC) with the environment as well as its associated contact features at TOC. Our algorithm is a generalization of conservative advancement [19] to general polyhedra. In this approach, we calculate the motion bound of a moving polyhedral model and estimate the TOC based on this bound, and advance the model by the current TOC estimate. We iterate this process until the inter-distance between the moving model and the other objects in the environments is below a user-defined distance threshold. We pose the problem of calculating the motion bound as a linear programming problem and provide an efficient, novel solution based on the simplex method. Moreover, we also provide a hierarchical advancement technique based on a bounding volume traversal tree to generalize the conservative advancement for non-convex models. Our algorithm is relatively simple to implement and has very small computational overhead of merely performing discrete collision detection multiple times. We extensively benchmarked our algorithm in different scenarios, and in comparison to other known continuous collision detection algorithms, the performance improvement ranges by a factor of 1.4～45.5 depending on benchmarking scenarios. Moreover, our algorithm can perform CCD at 120～15460 frames per second on a 3.6 GHz Pentium 4 PC for complex models consisting of 10K～70K triangles.