PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS

DOI10.1142/S012905410600398XzbMATH Open1096.68115MaRDI QIDQ5483373FDOQ5483373

Authors: Srečko Brlek, Gilbert Labelle, Annie Lacasse 

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Developments in Language Theory
• scientific article; zbMATH DE number 890669
• Shuffle operations on discrete paths
• Salient and reentrant points of discrete sets
• On a property of lattice paths

zbMATH Keywords

lattice pathspolyominoeswinding numberdiscrete regionssalient and reentrant points

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Polyominoes (05B50)

Cites Work

• Euclidean Paths: A New Representation of Boundary of Discrete Regions

Cited In (15)

• On the tiling by translation problem
• Combinatorial properties of double square tiles
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• Lyndon + Christoffel = digitally convex
• Convex and concave vertices on a simple closed curve in the triangular grid
• Serial Isogons of 90 Degrees
• Christoffel and Fibonacci tiles
• Combinatorial View of Digital Convexity
• Developments in Language Theory
• Shuffle operations on discrete paths
• Salient and Reentrant Points of Discrete Sets
• Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)
• Two infinite families of polyominoes that tile the plane by translation in two distinct ways
• A linear time and space algorithm for detecting path intersection
• A parallelogram tile fills the plane by translation in at most two distinct ways

This page was built for publication: PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483373)