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
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Bounding Volumes for Linearly Interpolated Shapes
CGI '04 Proceedings of the Computer Graphics International
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Point based animation of elastic, plastic and melting objects
SCA '04 Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation
Meshless deformations based on shape matching
ACM SIGGRAPH 2005 Papers
Meshless animation of fracturing solids
ACM SIGGRAPH 2005 Papers
Efficient collision detection for spherical blend skinning
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Fast arbitrary splitting of deforming objects
Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation
Adaptive deformations with fast tight bounds
SCA '07 Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation
FastLSM: fast lattice shape matching for robust real-time deformation
ACM SIGGRAPH 2007 papers
Interruptible collision detection for deformable objects
Computers and Graphics
A unified lagrangian approach to solid-fluid animation
SPBG'05 Proceedings of the Second Eurographics / IEEE VGTC conference on Point-Based Graphics
Bounded normal trees for reduced deformations of triangulated surfaces
Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
A comparison of sampling strategies for computing general sweeps
Computer-Aided Design
| Hi-index | 0.00 |
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated by a comparatively small number of simulation nodes, we are able to compute tight bounding volumes with a cost linear in the number of simulation nodes. Our approach extends concepts about bounds of convex sets to the meshless deformation setting, and we introduce an efficient algorithm for finding extrema of these convex sets. The extrema can be used for efficiently updating bounding volumes such as AABBs or k-DOPs, as we show in our results. The choice of particular bounding volume may depend on the complexity of the contact configurations, but in all cases we can compute surface bound orders of magnitude faster and/or tighter than with previous methods.