Sciweavers

410 search results - page 1 / 82
» A Fast Method for Local Penetration Depth Computation
Sort
View
JGTOOLS
2006
80views more  JGTOOLS 2006»
13 years 4 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
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
VMV
2004
103views Visualization» more  VMV 2004»
13 years 6 months ago
Consistent penetration depth estimation for deformable collision response
Penalty approaches can be used to efficiently resolve collisions of dynamically simulated rigid and deformable objects. These methods compute penalty forces based on the penetrati...
Bruno Heidelberger, Matthias Teschner, Richard Kei...
HAPTICS
2002
IEEE
13 years 10 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...
IROS
2007
IEEE
137views Robotics» more  IROS 2007»
13 years 11 months ago
Energy-based 6-DOF penetration depth computation for penalty-based haptic rendering algorithms
Abstract— Existing penalty-based haptic rendering approaches compute penetration depth in strictly translational sense and cannot properly take object rotation into account. We a...
Maxim Kolesnikov, Milos Zefran