Computing form-closure configurations

We present the first output-sensitive algorithm for computing all placements of four (frictionless) points that put a polygonal part in form closure. Our efficient algorithm runs in O(n/sup 2+/spl epsiv//+K) time, where n is the number of vertices of the polygon, K is the description size of the set of form closure placements, and /spl epsiv/ is an arbitrarily small constant. The basis of our algorithm is a translation of the problem into geometric searching problems, which are solved with the use of efficient data structures. Our results can be extended to the problem of computing all placements of a line and two points that put a polygonal part in form closure. The resulting algorithm runs in O(n/sup 2/ log/sup 2/ n+K) time, where K is again the description size of the output.

[1]  Joel W. Burdick,et al.  Mobility of bodies in contact. I. A 2nd-order mobility index for multiple-finger grasps , 1994, IEEE Trans. Robotics Autom..

[2]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[3]  Kenneth Y. Goldberg,et al.  A complete algorithm for synthesizing modular fixtures for polygonal parts , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[4]  Mark H. Overmars,et al.  Algorithms for fixture design , 1996 .

[5]  Van-Duc Nguyen,et al.  Constructing Force- Closure Grasps , 1988, Int. J. Robotics Res..

[6]  Christos H. Papadimitriou,et al.  The Geometry of Grasping , 1990, Int. J. Robotics Res..

[7]  Otfried Cheong,et al.  Immobilizing polygons against a wall , 1995, SCG '95.

[8]  Kenneth Y. Goldberg,et al.  A complete algorithm for designing planar fixtures using modular components , 1996, IEEE Trans. Robotics Autom..