Given an object with n points on its boundary where fingers can be placed, we give algorithms to select a "strong " grasp with a minimal number c of fingers (up to a logarithmic factor) for several measures of goodness. Along similar lines, given an integer c, we find the "best" c log c finger grasp for a small constant. Depending on the measure, the algorithms run in expected time O(c 2
|
801
|
Geometric algorithms and combinatorial optimization
– Grotschel, Lovasz, et al.
- 1987
|
|
382
|
A Mathematical Introduction to Robotic Manipulation
– Murray, Li, et al.
- 1994
|
|
346
|
New applications of random sampling to computational geometry
– CLARKSON
- 1987
|
|
220
|
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
– Edelsbrunner, Mucke
- 1990
|
|
179
|
Convex Polytopes
– Grünbaum
- 2003
|
|
127
|
On the existence and synthesis of multifinger positive grips
– Mishra, Schwartz, et al.
- 1987
|
|
114
|
K: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput Geom
– Avis, Fukuda
- 1992
|
|
98
|
Almost optimal set covers in finite VC-dimension: (preliminary version
– Bronnimann, Goodrich
- 1994
|
|
97
|
Planning optimal grasps
– Ferrari, Canny
- 1992
|
|
94
|
The geometry of grasping
– Markenscoff, Ni, et al.
- 1990
|
|
80
|
Reporting points in halfspaces
– Matousek
- 1992
|
|
70
|
On linear-time deterministic algorithms for optimization problems in fixed dimensions
– Chazelle, Matousek
- 1993
|
|
66
|
A geometric consistency theorem for a symbolic perturbation scheme
– Yap
- 1990
|
|
65
|
Output-sensitive results on convex hulls, extreme points, and related problems
– Chan
- 1996
|
|
57
|
An optimal convex hull algorithm in any fixed dimension
– Chazelle
- 1993
|
|
52
|
Algorithms for polytope covering and approximation
– Clarkson
- 1993
|
|
48
|
Quantitative Steinitz’s theorems with applications to multifingered grasping
– Kirkpatrick, Mishra, et al.
- 1990
|
|
43
|
Convex polytopes and the upper bound conjecture
– McMulIen, Shephard
- 1971
|
|
37
|
Linear optimization queries
– Matousek
- 1993
|
|
28
|
Separation and approximation of polyhedral surfaces
– Mitchell, Suri
- 1992
|
|
26
|
The complexity of minimum convex nested polyhedra
– Das, Joseph
- 1990
|
|
23
|
R.: Efficient perturbations for handling geometric degeneracies. Algorithmica 19
– Emiris, Canny, et al.
- 1997
|
|
22
|
On the existence of modular fixtures
– Zhuang, Goldberg, et al.
- 1994
|
|
16
|
A survey of linear programming in randomized subexponential time
– Goldwasser
- 1995
|
|
14
|
Grasp metrics: Optimality and complexity
– Mishra
- 1994
|
|
7
|
Constructing force-closure grasps in 3d
– Nguyen
- 1987
|
|
6
|
Minimal fixturing of frictionless assemblies: Complexity and algorithms
– Baraff, Mattikalli, et al.
- 1994
|
|
1
|
Workholding -- Analysis, Design and Planning
– Mishra
- 1991
|
|
1
|
Grasping and Fixturing: Theory and Practice
– Teichmann
- 1995
|
|
1
|
Grasping and Fixturing: A Geometric Analysis and an Implementation
– Teichmann
- 1995
|
|
