Geometric approaches to nonplanar quadric surface intersection curves
ACM Transactions on Graphics (TOG)
Curved surfaces and coherence for non-penetrating rigid body simulation
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
V-Clip: fast and robust polyhedral collision detection
ACM Transactions on Graphics (TOG)
An algebraic condition for the separation of two ellipsoids
Computer Aided Geometric Design
Obstacle Collision Detection Using Best Ellipsoid Fit
Journal of Intelligent and Robotic Systems
Efficient Distance Computation for Quadratic Curves and Surfaces
GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Classifying the Nonsingular Intersection Curve of Two Quadric Surfaces
GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Computing Distances between Surfaces Using Line Geometry
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Geometric Tools for Computer Graphics
Geometric Tools for Computer Graphics
Enhancing Levin's method for computing quadric-surface intersections
Computer Aided Geometric Design
Ellipsoid-tree construction for solid objects
Proceedings of the 2007 ACM symposium on Solid and physical modeling
An algebraic approach to continuous collision detection for ellipsoids
Computer Aided Geometric Design
EGSR'09 Proceedings of the Twentieth Eurographics conference on Rendering
Hi-index | 0.00 |
We present a simple, accurate and efficient algorithm for collision detection among moving ellipsoids. Its efficiency is attributed to two results: (i) a simple algebraic test for the separation of two ellipsoids, and (ii) an efficient method for constructing a separating plane between two disjoint ellipsoids. Inter-frame coherence is exploited by using the separating plane to reduce collision detection to simpler subproblems of testing for collision between the plane and each of the ellipsoids. Compared with previous algorithms (such as the GJK method) which employ polygonal approximation of ellipsoids, our algorithm demonstrates comparable computing speed and much higher accuracy.