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] This combinatorics-related article is a stub.
You can help Wikipedia by expanding it.