OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
LARGE a collision detection framework for deformable objects
VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
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
Deformed distance fields for simulation of non-penetrating flexible bodies
Proceedings of the Eurographic workshop on Computer animation and simulation
Davenport--Schinzel Sequences and Their Geometric Applications
Davenport--Schinzel Sequences and Their Geometric Applications
Efficient collision detection for animation and robotics
Efficient collision detection for animation and robotics
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Dynamic Interaction between Deformable Surfaces and Nonsmooth Objects
IEEE Transactions on Visualization and Computer Graphics
Interactive collision detection between deformable models using chromatic decomposition
ACM SIGGRAPH 2005 Papers
Computer Animation and Virtual Worlds - CASA 2005
Fast collision detection for deformable models using representative-triangles
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Proceedings of the 2008 ACM symposium on Solid and physical modeling
FASTCD: fracturing-aware stable collision detection
Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Collision-streams: fast GPU-based collision detection for deformable models
I3D '11 Symposium on Interactive 3D Graphics and Games
Ray tracing dynamic scenes using selective restructuring
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
PDQ: Parallel Distance Queries for deformable meshes
Graphical Models
Radial view based culling for continuous self-collision detection of skeletal models
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AABB tree and the kinetic BoxTree.The event-based approach of the kinetic data structures framework enables us to show that our algorithms are optimal in the number of updates. Moreover, we show a lower bound for the total number of BV updates, which is independent of the number of frames.We used our kinetic bounding volume hierarchies for collision detection and performed a comparison with the classical bottom-up update method. The results show that our algorithms perform up to ten times faster in practically relevant scenarios.