Sciweavers

48 search results - page 4 / 10
» Fast collision detection using the A-buffer
Sort
View
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
13 years 8 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha
EGH
2003
Springer
14 years 3 months ago
CULLIDE: interactive collision detection between complex models in large environments using graphics hardware
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
Naga K. Govindaraju, Stephane Redon, Ming C. Lin, ...
ICARCV
2008
IEEE
170views Robotics» more  ICARCV 2008»
14 years 4 months ago
A fast Monte Carlo algorithm for collision probability estimation
—In order to navigate safely, it is important to detect and to react to a potentially dangerous situation. Such a situation can be underlined by a judicious use of the locations ...
Alain Lambert, Dominique Gruyer, Guillaume Saint-P...
VRML
1997
ACM
14 years 2 months ago
QOTA: A Fast, Multi-Purpose Algorithm for Terrain Following in Virtual Environments
To keep avatars and other moving objects on the ground in virtual environments, it is necessary to find the points where these objects should contact the terrain. This is often do...
John W. Barrus, Richard C. Waters
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
14 years 1 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin