PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
From MaRDI portal
Recommendations
Cited in
(16)- Combinatorial properties of double square tiles
- On the tiling by translation problem
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- Lyndon + Christoffel = digitally convex
- Serial Isogons of 90 Degrees
- Convex and concave vertices on a simple closed curve in the triangular grid
- Christoffel and Fibonacci tiles
- Combinatorial View of Digital Convexity
- Shuffle operations on discrete paths
- Developments in Language Theory
- Salient and Reentrant Points of Discrete Sets
- Self-avoiding closed curves in the regular and semiregular grids
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways
- Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of \(\mathbb{Z}^2\)
- 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)
