Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Combinatorics of patterns of a bidimensional Sturmian sequence.
Theoretical Computer Science
Double sequences with complexity mn+11
Automatica (Journal of IFAC)
Thin discrete triangular meshes
Theoretical Computer Science
Palindromes and two-dimensional sturmian sequences
Journal of Automata, Languages and Combinatorics
Balance properties of multi-dimensional words
Theoretical Computer Science
On a conjecture on bidimensional words
Theoretical Computer Science
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Connectivity of discrete planes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Digital Straight Line Segments
IEEE Transactions on Computers
Truly alphabet-independent two-dimensional pattern matching
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Binary images, M-vectors, and ambiguity
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Hi-index | 0.00 |
In this paper we propose a simple scheme for obtaining plane digitizations. We study digital plane periodicity and consider various issues related to two-dimensional (2D) Sturmian words. Concepts and results, already known for one-dimensional words, are extended to 2D words. In particular, we address a conjecture by Maurice Nivat for the case of digital 2D rays. Our approach is based in part on extending periodicity studies in theory of words to 2D words based on (Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 440-452; Proceedings of the 33rd IEEE Symposium on Foundations in Computer Science, 1992, pp. 247-250).