Sciweavers

279 search results - page 18 / 56
» Implicit Convex Polygons
Sort
View
DCG
2010
75views more  DCG 2010»
13 years 7 months ago
Star Unfolding Convex Polyhedra via Quasigeodesic Loops
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...
Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
IJRR
2008
107views more  IJRR 2008»
13 years 7 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
CCCG
2010
13 years 9 months ago
Multi-guard covers for polygonal regions
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
HAPTICS
2005
IEEE
14 years 1 months ago
Stable and Responsive Six-Degree-of-Freedom Haptic Manipulation Using Implicit Integration
In this paper we present a novel approach for simulating the rigid body dynamics of a haptically manipulated object using implicit integration. Our formulation requires the linear...
Miguel A. Otaduy, Ming C. Lin
ICRA
1994
IEEE
77views Robotics» more  ICRA 1994»
13 years 11 months ago
Sensing Polygon Poses by Inscription
Industrial assembly involves sensing the pose (orientation and position) of a part. Efficient and reliable sensing strategies can be developed for an assembly task if the shape of...
Yan-Bin Jiang, Michael Erdmann