Computing grasp functions
From MaRDI portal
Publication:1917051
DOI10.1016/0925-7721(95)00022-4zbMath0849.68127OpenAlexW1986397447WikidataQ57366226 ScholiaQ57366226MaRDI QIDQ1917051
Anil S. Rao, Kenneth Y. Goldberg
Publication date: 4 November 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/17318
Related Items
Uses Software
Cites Work
- Estimates for the minimal width of polytopes inscribed in convex bodies
- Diameter, width, closest line pair, and parametric searching
- Orienting polygonal parts without sensors
- Diameter and radius in the Manhattan metric
- Computational geometry in a curved world
- Diameter partitioning
- Reconstruction of polygons from projections
- Off-line dynamic maintenance of the width of a planar point set
- Minimizing the sum of diameters efficiently
- Convex hulls of piecewise-smooth Jordan curves
- Computing the width of a set
- Symmetry Theorems for Isospin-Invariant Reactions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing grasp functions