Plane digitization and related combinatorial problems

DOI10.1016/j.dam.2004.09.010zbMath1068.68111MaRDI QIDQ1775618

Valentin E. Brimkov, Reneta P. Barneva

Publication date: 4 May 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.09.010

zbMATH Keywords

Sturmian words; Array periodicity; Plane digitization; Plane discretization

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Generation and recognition of digital planes using multi-dimensional continued fractions, Digital planarity -- a review, Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension, Minimal arithmetic thickness connecting discrete planes, Optimal discovery of repetitions in 2D, Binary Images, M −Vectors, and Ambiguity

Cites Work

• Connectivity of discrete planes
• Combinatorics on patterns of a bidimensional Sturmian sequence
• Parallelogram tilings and Jacobi-Perron algorithm
• Thin discrete triangular meshes
• Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
• Balance properties of multi-dimensional words
• Digital straightness -- a review
• On a conjecture on bidimensional words.
• Local configurations in a discrete plane
• Digital Straight Line Segments
• Sequences with minimal block growth
• Discrete Geometry for Computer Imagery
• Double sequences of low complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item