Abstract
The critical thickness of an arithmetical discrete plane refers to the infimum thickness that preserves its 2-connectedness. This infimum thickness can be computed thanks to a multidimensional continued fraction algorithm, namely the fully subtractive algorithm. We provide a characterization of the discrete planes with critical thickness that contain the origin and that are 2-connected.
Chapter PDF
Similar content being viewed by others
References
Andres, E.: Discrete linear objects in dimension n: the standard model. Graphical Models 65(1-3), 92–111 (2003)
Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. CVGIP: Graphical Model and Image Processing 59(5), 302–309 (1997)
Arnoux, P., Ito, S.: Pisot substitutions and Rauzy fractals. Bull. Belg. Math. Soc. Simon Stevin 8(2), 181–207 (2001)
Berthé, V., Domenjoud, E., Jamet, D., Provençal, X., Toutant, J.L.: Oral Communication in Numeration and Substitution 2012, June 4-8, Kyoto (2012)
Berthé, V., Jolivet, T., Siegel, A.: Substitutive Arnoux-rauzy sequences have pure discrete spectrum. Unif. Distrib. Theory 7(1), 173–197 (2012)
Brimkov, V.E., Barneva, R.P.: Connectivity of discrete planes. Theor. Comput. Sci. 319(1-3), 203–227 (2004)
Domenjoud, E., Jamet, D., Toutant, J.L.: On the Connecting Thickness of Arithmetical Discrete Planes. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 362–372. Springer, Heidelberg (2009)
Fernique, T.: Bidimensional Sturmian Sequences and Substitutions. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 236–247. Springer, Heidelberg (2005)
Jamet, D., Toutant, J.L.: On the Connectedness of Rational Arithmetic Discrete Hyperplanes. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 223–234. Springer, Heidelberg (2006)
Jamet, D., Toutant, J.L.: Minimal arithmetic thickness connecting discrete planes. Discrete Applied Mathematics 157(3), 500–509 (2009)
Meester, R.W.J.: An algorithm for calculating critical probabilities and percolation functions in percolation models defined by rotations. Ergodic Theory Dynam. Systems 9(3), 495–509 (1989)
Meester, R.W.J., Nowicki, T.: Infinite clusters and critical values in two-dimensional circle percolation. Israel J. Math. 68(1), 63–81 (1989)
Reveillès, J.P.: Géométrie discrète, calcul en nombres entiers et algorithmique. Thèse d’état, Université Louis Pasteur, Strasbourg (1991)
Schweiger, F.: Multidimensional continued fractions. Oxford Science Publications. Oxford University Press, Oxford (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthé, V., Jamet, D., Jolivet, T., Provençal, X. (2013). Critical Connectedness of Thin Arithmetical Discrete Planes. In: Gonzalez-Diaz, R., Jimenez, MJ., Medrano, B. (eds) Discrete Geometry for Computer Imagery. DGCI 2013. Lecture Notes in Computer Science, vol 7749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37067-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-37067-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37066-3
Online ISBN: 978-3-642-37067-0
eBook Packages: Computer ScienceComputer Science (R0)