Sciweavers

279 search results - page 29 / 56
» Implicit Convex Polygons
Sort
View
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
14 years 2 months ago
Fast grasp planning for hand/arm systems based on convex model
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
Kensuke Harada, Kenji Kaneko, Fumio Kanehiro
ADCM
2007
134views more  ADCM 2007»
13 years 7 months ago
Barycentric coordinates for convex sets
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous appli...
Joe D. Warren, Scott Schaefer, Anil N. Hirani, Mat...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Resolving Loads with Positive Interior Stresses
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
Günter Rote, André Schulz
ICRA
2002
IEEE
115views Robotics» more  ICRA 2002»
14 years 19 days 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
COMPGEOM
2006
ACM
14 years 1 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir