Page 1 Next

Displaying 1 – 20 of 80

Showing per page

An algorithm for deciding if a polyomino tiles the plane

Ian Gambini, Laurent Vuillon (2007)

RAIRO - Theoretical Informatics and Applications

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 from algorithmics, discrete geometry and combinatorics on words.

Aperiodic Tiles.

G.C. Shephard, R. Ammann, B Grünbaum (1992)

Discrete & computational geometry

Currently displaying 1 – 20 of 80

Page 1 Next