The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Impulse-based simulation of rigid bodies
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
View-dependent refinement of progressive meshes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
View-dependent simplification of arbitrary polygonal environments
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Building and traversing a surface at variable resolution
VIS '97 Proceedings of the 8th conference on Visualization '97
Computing bounding volume hierarchies using model simplification
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
HLODs for faster display of large static and dynamic environments
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
ACM Transactions on Graphics (TOG)
Fast penetration depth computation for physically-based animation
Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation
Optimized view-dependent rendering for large polygonal datasets
Proceedings of the conference on Visualization '02
Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models
IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Level of Detail for 3D Graphics
Level of Detail for 3D Graphics
CLODs: dual hierarchies for multiresolution collision detection
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
FastMesh: Efficient View-Dependent Meshing
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
Quick-VDR: Out-of-Core View-Dependent Rendering of Gigantic Models
IEEE Transactions on Visualization and Computer Graphics
ACM SIGGRAPH 2005 Papers
Efficient collision culling among deformable objects using graphics processors
Presence: Teleoperators and Virtual Environments - Special issue: IEEE VR 2005
Efficient data reduction and cache-coherent techniques toward real-time performance
ACM SIGGRAPH 2007 courses
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
Real-Time Conflict Detection in Cooperative Plant Design System Combining Prior and Context
Computer Supported Cooperative Work in Design IV
Distributed smart cameras for hard real-time control
Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras
FASTCD: fracturing-aware stable collision detection
Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Hi-index | 0.00 |
We present a novel approach for collision detection between large models composed of tens of millions of polygons. Each model is represented as a clustered hierarchy of progressive meshes (CHPM). The CHPM is a dual hierarchy of the original model: it serves both as a multiresolution representation of the original model, as well as a bounding volume hierarchy. We use the cluster hierarchy of a CHPM to perform coarse-grained selective refinement and the progressive meshes for fine-grained local refinement. We present a novel conservative error metric to perform collision queries based on the multiresolution representation. We use this error metric to perform dynamic simplification for collision detection. Our approach is conservative in that it may overestimate the set of colliding regions, but never misses any collisions. Furthermore, we are able to generate these hierarchies and perform collision queries using out-of-core techniques on all triangulated models. We have applied our algorithm to perform conservative collision detection between massive CAD and scanned models, consisting of millions of triangles at interactive rates on a commodity PC.