An optimal algorithm for detecting pseudo-squares

Authors:
Srečko Brlek;Xavier Provençal
Affiliations:
Laboratoire de Combinatoire et d'Informatique Mathématique, Université du Québec à Montréal, Montréal, QC, Canada;Laboratoire de Combinatoire et d'Informatique Mathématique, Université du Québec à Montréal, Montréal, QC, Canada
Venue:
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Year:
2006

Citing 5
Cited 6

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)
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
Christoffel and Fibonacci tiles

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Planar configurations induced by exact polyominoes

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Two infinite families of polyominoes that tile the plane by translation in two distinct ways

Theoretical Computer Science
A decomposition theorem for homogeneous sets with respect to diamond probes

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of determining if a given word, which encodes the boundary of a discrete figure, tiles the plane by translation These words have been characterized by the Beauquier-Nivat condition, for which we provide a linear time algorithm in the case of pseudo-square polyominoes, improving the previous quadratic algorithm of Gambini and Vuillon.