Sciweavers

244 search results - page 2 / 49
» Generalized penetration depth computation
Sort
View
JGTOOLS
2006
80views more  JGTOOLS 2006»
13 years 6 months ago
A Fast Method for Local Penetration Depth Computation
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
Stephane Redon, Ming C. Lin
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
13 years 11 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
PG
2007
IEEE
14 years 10 days 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»
14 years 3 days 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...
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
A General Notion of Useful Information
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
Philippe Moser