98 search results - page 1 / 20 » A Fast and Practical Algorithm for Generalized Penetration D... |
RSS
2007
14 years 9 days ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
SMA
2006
ACM
14 years 4 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
ICRA
2002
IEEE
14 years 3 months ago
2002
IEEE
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
SMA
1995
ACM
14 years 2 months ago
1995
ACM
: 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...