Skip to Main content Skip to Navigation
Conference papers

Critical Connectedness of Thin Arithmetical Discrete Planes

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.
Complete list of metadatas
Contributor : Xavier Provençal <>
Submitted on : Sunday, February 9, 2014 - 2:24:09 AM
Last modification on : Saturday, March 28, 2020 - 2:07:19 AM


  • HAL Id : hal-00943827, version 1


Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal. Critical Connectedness of Thin Arithmetical Discrete Planes. International Conference Discrete Geometry for Computer Imagery, Mar 2013, Sevilla, Spain. pp.107-118. ⟨hal-00943827⟩



Record views