49 search results - page 5 / 10 » A Fibonacci tiling of the plane |
COMBINATORICS
2006
13 years 7 months ago
2006
Let Sm,n be the graph on the vertex set Zm
ITA
2007
13 years 7 months ago
2007
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...
TIT
2002
13 years 7 months ago
2002
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
This paper introduces and presents a solution to the “Escherization” problem: given a closed figure in the plane, find a new closed figure that is similar to the original a...
COMBINATORICS
2006
13 years 7 months ago
2006
Beauquier and Nivat introduced and gave a characterization of the class of pseudo-square polyominoes that tile the plane by translation: a polyomino tiles the plane by translation...