Parallel depth first search. Part I. implementation
International Journal of Parallel Programming
Scalable load balancing techniques for parallel computers
Journal of Parallel and Distributed Computing
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Incremental 3D collision detection with hierarchical data structures
VRST '98 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
A Benchmark for Animated Ray Tracing
IEEE Computer Graphics and Applications
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
CLODs: dual hierarchies for multiresolution collision detection
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Adaptive medial-axis approximation for sphere-tree construction
ACM Transactions on Graphics (TOG)
Interactive collision detection between deformable models using chromatic decomposition
ACM SIGGRAPH 2005 Papers
Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology) (The Morgan Kaufmann Series in Interactive 3D Technology)
Kinetic bounding volume hierarchies for deformable objects
Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications
Fast proximity computation among deformable models using discrete Voronoi diagrams
ACM SIGGRAPH 2006 Papers
A fast triangle to triangle intersection test for collision detection: Research Articles
Computer Animation and Virtual Worlds
Fast continuous collision detection for articulated models
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Physically based simulation of cloth on distributed memory architectures
Parallel Computing
Continuous collision detection for articulated models using Taylor models and temporal culling
ACM SIGGRAPH 2007 papers
Fast collision detection for deformable models using representative-triangles
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Adjacency-based culling for continuous collision detection
The Visual Computer: International Journal of Computer Graphics
Real-time KD-tree construction on graphics hardware
ACM SIGGRAPH Asia 2008 papers
On fast Construction of SAH-based Bounding Volume Hierarchies
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
IEEE Transactions on Visualization and Computer Graphics
Multi-core collision detection between deformable models
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
A dynamic bounding volume hierarchy for generalized collision detection
Computers and Graphics
Scalable parallel collision detection simulation
SIP '07 Proceedings of the Ninth IASTED International Conference on Signal and Image Processing
Ray tracing dynamic scenes using selective restructuring
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
Real-time collision culling of a million bodies on graphics processing units
ACM SIGGRAPH Asia 2010 papers
Collision-streams: fast GPU-based collision detection for deformable models
I3D '11 Symposium on Interactive 3D Graphics and Games
GPU-based parallel collision detection for fast motion planning
International Journal of Robotics Research
Fast continuous collision culling with deforming noncollinear filters
Computer Animation and Virtual Worlds
Speculative parallel asynchronous contact mechanics
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
PDQ: Parallel Distance Queries for deformable meshes
Graphical Models
A multi-threaded algorithm for computing the largest non-colliding moving geometry
Computer-Aided Design
| Hi-index | 0.00 |
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to accelerate these queries and present an incremental algorithm that exploits temporal coherence between successive frames. Our formulation distributes the computation among multiple cores by using fine-grained front-based decomposition. We also present efficient techniques to reduce the number of elementary tests and analyze the scalability of our approach. We have implemented the parallel algorithm on eight core and 16 core PCs, and observe up to 7x and 13x speedups respectively, on complex benchmarks.