On the number of factors of Sturmian words
Theoretical Computer Science
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Journal of Mathematical Imaging and Vision
A Comparative Study on 2D Curvature Estimators
ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
Persistent patterns in integer discrete circles
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.00 |
The aim of this short note is to describe the set of finite words that appear in the cutting sequences of a smooth curve to arbitrary small scale. This language strictly contains the factors of Sturmian words, and can be decided by a linear time algorithm.