46 search results - page 1 / 10 » Exploring Simple Grid Polygons |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We examine online grid covering with hexagonal and triangular grids. For arbitrary environments without obstacles we provide a strategy that produces tours of length S C + 1 4 E ...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
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...
ISAAC
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer