Interactive and continuous collision detection for avatars in virtual environments

Redon, Stéphane; Kim, Young J; Manocha, Dinesh; Templeman, James N.

doi:10.1109/vr.2004.1310064

Cited by 23 publications

(17 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Redon et al [21] bound the motion trajectory of linear swept spheres (LSS) by using interval arithmetic and the resulting bound has been used for dynamic collision checking between a moving avatar and the virtual environment. However, these methods do not take into account how close a robot and obstacles are displaced from each other (i.e.…”

Section: B Motion Bound Calculationmentioning

confidence: 99%

C<sup>2</sup>A: Controlled conservative advancement for continuous collision detection of polygonal models

Tang

Kim

Manocha

2009

2009 IEEE International Conference on Robotics and Automation

Self Cite

View full text Add to dashboard Cite

Abstract-We present a simple and fast algorithm to perform continuous collision detection between polygonal models undergoing rigid motion for interactive applications. Our approach can handle all triangulated models and makes no assumption about the underlying geometry and topology. The algorithm uses the notion of conservative advancement (CA), originally developed for convex polytopes [1], [2]. We extend this formulation to general models using swept sphere volume hierarchy and present a compact formulation to compute the motion bounds along with a novel controlling scheme. We have implemented the algorithm and highlight its performance on various benchmarks. In practice, our algorithm can perform continuous collision queries in few milli-seconds on models composed of tens of thousands of triangles.

show abstract

Section: B Motion Bound Calculationmentioning

confidence: 99%

C<sup>2</sup>A: Controlled conservative advancement for continuous collision detection of polygonal models

Tang

Kim

Manocha

2009

2009 IEEE International Conference on Robotics and Automation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Based on a simplified motion model, they find a first time of contact for a given period of time [Redon et al 2002]. Continuous CD algorithms have been proposed also for articulated models [Redon et al 2004], but only articulated objects composed of rigid parts were considered (such as robots).…”

Section: Related Workmentioning

confidence: 99%

Efficient collision detection for spherical blend skinning

Kavan

O’Sullivan

Žára

2006

Proceedings of the 4th International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast As

View full text Add to dashboard Cite

Recently, two algorithms improving the real-time simulation of articulated models in virtual environments have been published: 1) fast collision detection for linear blend skinning and 2) spherical blend skinning. Both linear and spherical blending solve the skinning problem of a skeletally controlled 3D model (e.g., an avatar), but only spherical blending avoids artifacts such as the candywrapper. However, to date, fast collision detection has been limited to linear blending. This paper describes how to perform collision detection for models skinned with the more sophisticated spherical method. As a result, both high-quality skinning and fast and exact collision detection can be achieved -there is no longer any need for a trade-off. The generalization from linear to spherical blending involves the construction of rotation bounds, derived using a quaternion representation. The resulting algorithm is simple to implement and fast enough for real-time virtual reality applications.

show abstract

“…They develop efficient algorithms of interactive speed for CCD while employing effective computational tools for culling redundant geometry at various stages of computation. Redon et al [21] use Oriented Bounding Box (OBB) as the basic bounding volume, whereas Redon et al [22], [23] and Kim et al [25] employ Line Swept Sphere (LSS). These methods take geometric approaches in culling redundant geometry.…”

mentioning

confidence: 99%

“…These methods take geometric approaches in culling redundant geometry. In particular, Redon et al [22], [23] and Kim et al [25] apply a GPU-based collision detection to the swept volumes of LSS primitives against the environment; moreover, Govindaraju et al [24] present a GPU-based algorithm that can also deal with deformable models. Zhang et al [26], on the other hand, deal with the CCD of articulated models with the approach of conservative advancement that repeatedly moves objects by a computed time step while ensuring non-collision.…”

mentioning

confidence: 99%

Continuous Collision Detection for Ellipsoids

Choi

Chang

Wang

et al. 2009

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-We present an accurate and efficient algorithm for continuous collision detection between two moving ellipsoids under rational Euclidean or affine motion. We start with a highly optimized implementation of interference testing between two stationary ellipsoids based on an algebraic condition described in terms of the signs of roots of the characteristic equation of two ellipsoids. Then we derive a time-dependent characteristic equation for two moving ellipsoids, which enables us to develop an efficient algorithm for computing the time intervals in which two moving ellipsoids collide. The effectiveness of our approach is demonstrated with practical examples.

show abstract

Interactive and continuous collision detection for avatars in virtual environments

Abstract: We

Cited by 23 publications

References 28 publications

C<sup>2</sup>A: Controlled conservative advancement for continuous collision detection of polygonal models

C<sup>2</sup>A: Controlled conservative advancement for continuous collision detection of polygonal models

Efficient collision detection for spherical blend skinning

Continuous Collision Detection for Ellipsoids

Contact Info

Product

Resources

About