Sciweavers

Share
ICRA
2002
IEEE

DEEP: Dual-Space Expansion for Estimating Penetration Depth Between Convex Polytopes

9 years 4 months ago
DEEP: Dual-Space Expansion for Estimating Penetration Depth Between Convex Polytopes
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution” by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local Gauss map. In practice, the algorithm works well when there is high motion coherence in the environment and is able to compute the optimal solution in most cases. Keywords— Penetration Depth, Minkowski Sums, Incremental Algorithm
Young J. Kim, Ming C. Lin, Dinesh Manocha
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where ICRA
Authors Young J. Kim, Ming C. Lin, Dinesh Manocha
Comments (0)
books