Interval methods for multi-point collisions between time-dependent curved surfaces
John M. Snyder, Adam R. Woodbury, Kurt Fleischer et al. · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · 1993
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisions at multiple points of contact. When the regions of contact form curves or surfaces, it returns a finite set of points uniformly distributed over each contact region. Collisions can be computed for a very general class of surfaces: those for which inclusion functions can be constructed. Included in this set are the familiar kinds of surfaces and time behaviors encountered in computer graphics. We use a new interval approach for constrained minimization to detect collisions, and a tangency condition to reduce the dimensionality of the search space. These approaches make interval methods practical for multi-point collisions between complex surfaces. An interval Newton method based on the solution of the interval linear equation is used to speed convergence to the collision time and location. This method is mor...
Cited by 118 works. doi:10.1145/166117.166158
Authors
References
- Savitzky-Golay Smoothing Filters
- Methods and Applications of Interval Analysis
- Introduction to Interval Computation
- Collision Detection and Response for Computer Animation
- Analytical methods for dynamic simulation of non-penetrating rigid bodies
- New Computer Methods for Global Optimization
- Curved surfaces and coherence for non-penetrating rigid body simulation
- Curved surfaces and coherence for non-penetrating rigid body simulation
- Generalized implicit functions for computer graphics
- Generalized implicit functions for computer graphics