cutting sequence

{{short description|Records individual grid lines crossed ("cut") as a curve crosses a square grid}}

File:Fibonacci word cutting sequence.png is an example of a Sturmian word. The start of the cutting sequence shown here illustrates the start of the word 0100101001.]]

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.{{Cite journal | last1 = Monteil | first1 = T. | doi = 10.4204/EPTCS.63.21 | title = The complexity of tangent words | journal = Electronic Proceedings in Theoretical Computer Science | volume = 63 | pages = 152–157 | year = 2011 | arxiv = 1108.3632 | s2cid = 6350859 }}

Sturmian words are a special case of cutting sequences where the curves are straight lines of irrational slope.Pytheas Fogg (2002) p.152

References

;Notes

{{reflist}}

;Bibliography

  • {{cite book | last=Pytheas Fogg | first=N. | editor1-first=Valérie | editor1-last = Berthé |editor1-link = Valérie Berthé| editor2-last = Ferenczi | editor2-first= Sébastien | editor3-last= Mauduit | editor3-first= Christian | editor4-last= Siegel | editor4-first= A. | title=Substitutions in dynamics, arithmetics and combinatorics | series=Lecture Notes in Mathematics | volume=1794 | location=Berlin | publisher=Springer-Verlag | year=2002 | isbn=3-540-44141-7 | zbl=1014.11015 }}

{{combin-stub}}

Category:Discrete mathematics

Category:Digital geometry

Category:Sequences and series