Skip to main content
Conference ProceedingsOPEN ACCESS

Critical connectedness of thin arithmetical discrete planes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7749 LNCS 107-118
DOI: 10.1007/978-3-642-37067-0_10
11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Berthé, V., Jamet, D., Jolivet, T., & Provençal, X. (2013). Critical connectedness of thin arithmetical discrete planes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7749 LNCS, pp. 107–118). Springer Verlag. https://doi.org/10.1007/978-3-642-37067-0_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free