Sciweavers

410 search results - page 2 / 82
» A Fast Method for Local Penetration Depth Computation
Sort
View
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
13 years 11 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
2002
IEEE
115views Robotics» more  ICRA 2002»
13 years 10 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
HAPTICS
2007
IEEE
13 years 11 months ago
Accelerated Proximity Queries for Haptic Rendering of Deformable Models
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
Nico Galoppo, Miguel A. Otaduy, Paul Mecklenburg, ...
PG
2007
IEEE
13 years 11 months ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
13 years 11 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...