A note on a result of daurat and nivat

Authors:
Srečko Brlek;Gilbert Labelle;Annie Lacasse
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;Laboratoire de Combinatoire et d'Informatique Mathématique, Université du Québec à Montréal, Montréal, QC, Canada
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 2
Cited 7

Tilings and patterns

Tilings and patterns
Euclidean paths: a new representation of boundary of discrete regions

Graphical Models and Image Processing

On the tiling by translation problem

Discrete Applied Mathematics
Combinatorial view of digital convexity

DGCI'08 Proceedings of the 14th 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
An optimal algorithm for detecting pseudo-squares

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A parallelogram tile fills the plane by translation in at most two distinct ways

Discrete Applied Mathematics
Combinatorial properties of double square tiles

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider paths in the square lattice and use a valuation called the winding number in order to exhibit some combinatorial properties on these paths. As a corollary, we obtain a characteristic property of self-avoiding closed paths, generalizing in this way a recent result of Daurat and Nivat (2003) on the boundary properties of polyominoes concerning salient and reentrant points.