Sciweavers

13 search results - page 1 / 3
» Immobilizing Hinged Polygons
Sort
View
IJCGA
2007
76views more  IJCGA 2007»
13 years 5 months ago
Immobilizing Hinged Polygons
: We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, wh...
Jae-Sook Cheong, A. Frank van der Stappen, Kenneth...
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
13 years 3 months ago
Immobilizing 2D serial chains in form closure grasps
: The immobilization of non-rigid objects is currently an active research area in robotics. This paper explores the problem by studying the immobilization of serial chains of rigid...
Elon Rimon, A. Frank van der Stappen
CCCG
2003
13 years 6 months ago
Hinged Dissection of Polygons is Hard
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
Robert A. Hearn, Erik D. Demaine, Greg N. Frederic...
ALGORITHMICA
2006
109views more  ALGORITHMICA 2006»
13 years 5 months ago
Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
: We study the output-sensitive computations of all the combinations of the edges and vertices of a simple polygon P that allow a form closure grasp with less than four point conta...
Jae-Sook Cheong, Herman J. Haverkort, A. Frank van...
ISAAC
2003
Springer
103views Algorithms» more  ISAAC 2003»
13 years 10 months ago
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts
Jae-Sook Cheong, Herman J. Haverkort, A. Frank van...