Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Creutzburg, E., Hübler, A., Wedler, V.: On-line erkennung digitaler geradensegmente in linearer zeit. In: Proceedings of GEO-BILD 1982, Wiss. Beitrage der FSU Jena, pp. 48–65 (1982)
Hermann, S., Klette, R.: A comparative study on 2d curvature estimators. In: International Conference on Computing: Theory and Applications, pp. 584–589 (2007)
Klette, R., Rosenfeld, A.: Digital straightness—a review. Discrete Appl. Math. 139(1-3), 197–230 (2004), http://dx.doi.org/10.1016/j.dam.2002.12.001
Kulpa, Z.: On the properties of discrete circles, rings, and disks. Computer Graphics and Image Processing 10(4), 348–365 (1979), http://www.sciencedirect.com/science/article/B7GXF-4K9JH6S-4/2/93cd964fb7568d8161432f0401fd4159
Lothaire, M.: Algebraic combinatorics on words, Encyclopedia of Mathematics and its Applications. In: Berstel, J., Séébold, P. (eds.) Sturmian Words, vol. 90. Cambridge University Press, Cambridge (2002)
Mignosi, F.: On the number of factors of Sturmian words. Theoret. Comput. Sci. (Algorithms Automat. Complexity Games) 82(1), 71–84 (1991), http://dx.doi.org/10.1016/0304-39759190172-X
Fogg, N.P.: Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics, vol. 1794, p. 402. Springer, Berlin (2002), http://dx.doi.org/10.1007/b13861 , chapter 6, Sturmian Sequences (by Pierre Arnoux)
Rojas, C., Troubetzkoy, S.: Coding Discretizations of Continuous Functions (2009), preprint, available at http://arxiv.org/abs/0907.2299
Smillie, J., Ulcigrai, C.: Symbolic coding for linear trajectories in the regular octagon (2009), preprint, available at http://arxiv.org/abs/0905.0871
de Vieilleville, F., Lachaud, J.-O., Feschet, F.: Convex digital polygons, maximal digital straight segments and convergence of discrete geometric estimators. J. Math. Imaging Vision 27(2), 139–156 (2007), http://dx.doi.org/10.1007/s10851-007-0779-x
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monteil, T. (2011). Another Definition for Digital Tangents. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds) Discrete Geometry for Computer Imagery. DGCI 2011. Lecture Notes in Computer Science, vol 6607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19867-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-19867-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19866-3
Online ISBN: 978-3-642-19867-0
eBook Packages: Computer ScienceComputer Science (R0)