Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Euclidean paths: a new representation of boundary of discrete regions
Graphical Models and Image Processing
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Salient and reentrant points of discrete sets
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A note on a result of daurat and nivat
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Lyndon + Christoffel = digitally convex
Pattern Recognition
Combinatorial view of digital convexity
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Arithmetic discrete planes are quasicrystals
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Christoffel and Fibonacci tiles
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A linear time and space algorithm for detecting path intersection
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A linear time and space algorithm for detecting path intersection in Zd
Theoretical Computer Science
About thin arithmetic discrete planes
Theoretical Computer Science
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
Theoretical Computer Science
A parallelogram tile fills the plane by translation in at most two distinct ways
Discrete Applied Mathematics
Non-lattice-periodic tilings of R3 by single polycubes
Theoretical Computer Science
A decomposition theorem for homogeneous sets with respect to diamond probes
Computer Vision and Image Understanding
On the shape of permutomino tiles
Discrete Applied Mathematics
Combinatorial properties of double square tiles
Theoretical Computer Science
| Hi-index | 0.05 |
On square or hexagonal lattices, tiles or polyominoes are coded by words. The polyominoes that tile the plane by translation are characterized by the Beauquier-Nivat condition. By using the constant time algorithms for computing the longest common extensions in two words, we provide a linear time algorithm in the case of pseudo-square polyominoes, improving the previous quadratic algorithm of Gambini and Vuillon. We also have a linear algorithm for pseudo-hexagon polyominoes not containing arbitrarily large square factors. The results are extended to more general tiles.