Fast ray tracing by ray classification
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
An Optimal Algorithm for Finding the Kernel of a Polygon
Journal of the ACM (JACM)
Hardware-assisted self-collision for deformable surfaces
VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
Normal bounds for subdivision-surface interference detection
Proceedings of the conference on Visualization '01
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Collision queries using oriented bounding boxes
Collision queries using oriented bounding boxes
BD-tree: output-sensitive collision detection for reduced deformable models
ACM SIGGRAPH 2004 Papers
Interactive collision detection between deformable models using chromatic decomposition
ACM SIGGRAPH 2005 Papers
Fast proximity computation among deformable models using discrete Voronoi diagrams
ACM SIGGRAPH 2006 Papers
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Bounded normal trees for reduced deformations of triangulated surfaces
Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Reduced deforming filter culling for fast continuous collision detection
Proceedings of the 17th ACM Symposium on Virtual Reality Software and Technology
FASTCD: fracturing-aware stable collision detection
Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Fast continuous collision detection using parallel filter in subspace
I3D '11 Symposium on Interactive 3D Graphics and Games
Sketch express: facial expressions made easy
Proceedings of the Eighth Eurographics Symposium on Sketch-Based Interfaces and Modeling
Adaptive image-based intersection volume
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Energy-based self-collision culling for arbitrary mesh deformations
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Fast continuous collision culling with deforming noncollinear filters
Computer Animation and Virtual Worlds
Modeling friction and air effects between cloth and deformable bodies
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Radial view based culling for continuous self-collision detection of skeletal models
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Dynamic radial view based culling for continuous self-collision detection
Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Special Section on CAD/Graphics 2013: Canopy-frame interactions for umbrella simulation
Computers and Graphics
Hi-index | 0.00 |
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for triangle meshes, however, such hierarchical data structures lose much of their power, because triangles adjacent to each other cannot be distinguished from actually colliding ones unless individually tested. Shape regularity of surface patches, described in terms of orientation and contour conditions, was proposed long ago as a culling criterion for hierarchical self-collision detection. However, to date, algorithms based on shape regularity had to trade conservativeness for efficiency, because there was no known algorithm for efficiently performing 2D contour self-intersection tests. In this paper, we introduce a star-contour criterion that is amenable to hierarchical computations. Together with a thorough analysis of the tree traversal process in hierarchical self-collision detection, it has led us to novel hierarchical data structures and algorithms for efficient yet conservative self-collision detection. We demonstrate the application of our algorithm to several example animations, and we show that it consistently outperforms other approaches.