Sciweavers

71 search results - page 2 / 15
» Touring a sequence of polygons
Sort
View
COCOON
2005
Springer
13 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...
CCCG
2010
13 years 7 months ago
Deflating polygons to the limit
In this paper we study polygonal transformations through an operation called deflation. It is known that some families of polygons deflate infinitely for given deflation sequences...
Perouz Taslakian, Isabel Hubard
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 3 months ago
Exploring Simple Triangular and Hexagonal Grid Polygons Online
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 ...
Daniel Herrmann, Tom Kamphans, Elmar Langetepe
BIRTHDAY
2008
Springer
13 years 8 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
BMVC
1998
13 years 7 months ago
Building Shape Models from Image Sequences using Piecewise Linear Approximation
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
Derek R. Magee, Roger D. Boyle