Interactions between digital geometry and combinatorics on words
From MaRDI portal
Abstract: We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the plane, and on the other hand by the development of digital geometry, this study reveals strong links between the two fields. Discrete figures are identified with polyominoes encoded by words. The combinatorial tools lead to elegant descriptions of geometrical features and efficient algorithms. Among these, radix-trees are useful for efficiently detecting path intersection, Lyndon and Christoffel words appear as the main tools for describing digital convexity; equations on words allow to better understand tilings by translations.
Recommendations
Cited in
(12)- First steps in the algorithmic reconstruction of digital convex sets
- Plane digitization and related combinatorial problems
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- Word equations with \(k\)th powers of variables
- A generalization of the Fibonacci word fractal and the Fibonacci snowflake
- Another definition for digital tangents
- Discrete geometry and symbolic dynamics
- The perimeter of uniform and geometric words: a probabilistic analysis
- Minimal non-convex words
- Combinatorial View of Digital Convexity
- Number of Words Characterizing Digital Balls on the Triangular Tiling
- Lyndon + Christoffel = digitally convex
This page was built for publication: Interactions between digital geometry and combinatorics on words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789507)