Sciweavers

98 search results - page 1 / 20
» A Fast and Practical Algorithm for Generalized Penetration D...
Sort
View
RSS
2007
134views Robotics» more  RSS 2007»
13 years 6 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— 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...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
13 years 10 months ago
Generalized penetration depth computation
— 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...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
13 years 10 months ago
Fast C-obstacle Query Computation for Motion Planning
— 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...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
13 years 9 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”...
Young J. Kim, Ming C. Lin, Dinesh Manocha
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
13 years 8 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