PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
From MaRDI portal
Publication:5483373
DOI10.1142/S012905410600398XzbMath1096.68115MaRDI QIDQ5483373
Annie Lacasse, Srečko Brlek, Gilbert Labelle
Publication date: 14 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05) Polyominoes (05B50)
Related Items (11)
Lyndon + Christoffel = digitally convex ⋮ Combinatorial properties of double square tiles ⋮ A parallelogram tile fills the plane by translation in at most two distinct ways ⋮ 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 in \(\mathbb Z^d\) ⋮ Shuffle operations on discrete paths ⋮ On the tiling by translation problem ⋮ Combinatorial View of Digital Convexity ⋮ Christoffel and Fibonacci Tiles ⋮ A Linear Time and Space Algorithm for Detecting Path Intersection ⋮ Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid
Cites Work
This page was built for publication: PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
