Sciweavers

42 search results - page 4 / 9
» Efficient Collision Detection between 2D Polygons
Sort
View
GMP
2008
IEEE
192views Solid Modeling» more  GMP 2008»
13 years 11 months ago
Efficient Collision Detection Using a Dual Bounding Volume Hierarchy
We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. ...
Jung-Woo Chang, Wenping Wang, Myung-Soo Kim
CGF
2008
144views more  CGF 2008»
13 years 11 months ago
High Performance GPU-based Proximity Queries using Distance Fields
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
T. Morvan, M. Reimers, E. Samset
WSCG
2004
197views more  WSCG 2004»
14 years 7 days ago
Collision Prediction Using MKtrees
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
Marta Franquesa-Niubó, Pere Brunet
SIGGRAPH
2010
ACM
14 years 3 months ago
Star-contours for efficient hierarchical self-collision detection
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 ...
Sara C. Schvartzman, Álvaro G. Pérez, Miguel A. ...
VC
2008
117views more  VC 2008»
13 years 10 months ago
Adjacency-based culling for continuous collision detection
We present an efficient approach to reduce the number of elementary tests for continuous collision detection between rigid and deformable models. Our algorithm exploits the connect...
Min Tang, Sung-Eui Yoon, Dinesh Manocha