Sciweavers

1557 search results - page 16 / 312
» On measuring areas of polygons
Sort
View
ICRA
2003
IEEE
87views Robotics» more  ICRA 2003»
15 years 11 months ago
A new algorithm for three-finger force-closure grasp of polygonal objects
—We prove a new necessary and sufficient condition for 2D three-finger equilibrium grasps and implement a geometrical algorithm for computing force-closure grasps of polygonal ob...
Jia-Wei Li, Ming-He Jin, Hong Liu
DCG
2000
104views more  DCG 2000»
15 years 5 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
CORR
2012
Springer
174views Education» more  CORR 2012»
14 years 1 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
COCOON
2005
Springer
15 years 11 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
CW
2008
IEEE
16 years 16 days ago
Automatic Surface Scanning of 3D Artifacts
—This paper describes an automatic 3D surface scanning technique using a 3D scanner. It allows the acquisition of a complete surface model of a 3D artifact without any manual reg...
Shiaofen Fang, Basil George, Mathew Palakal