Cutting sequence explained

In digital geometry, a cutting sequence is a sequence of symbols whose elements correspond to the individual grid lines crossed ("cut") as a curve crosses a square grid.^[1]

Sturmian words are a special case of cutting sequences where the curves are straight lines of irrational slope.^[2]

References

Notes

Bibliography

• Book: Pytheas Fogg, N. . Valérie . Berthé . Valérie Berthé. Ferenczi . Sébastien . Mauduit . Christian . Siegel . A. . Substitutions in dynamics, arithmetics and combinatorics . Lecture Notes in Mathematics . 1794 . Berlin . . 2002 . 3-540-44141-7 . 1014.11015 .

Notes and References

1. Monteil . T. . 10.4204/EPTCS.63.21 . The complexity of tangent words . Electronic Proceedings in Theoretical Computer Science . 63 . 152–157 . 2011 . 1108.3632 . 6350859 .
2. Pytheas Fogg (2002) p.152