Critical connectedness of thin arithmetical discrete planes

DOI10.1007/978-3-642-37067-0_10MaRDI QIDQ4924464zbMATH OpenOpenAlexFDO

Authors Valérie Berthé, Damien Jamet, Timo Jolivet, Xavier Provençal

Publication date 31 May 2013

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.7820

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully subtractive algorithm. This multidimensional continued fraction algorithm consists, in its linear form, in subtracting the smallest entry to the other ones. We provide a characterization of the discrete planes with critical thickness that have zero intercept and that are $2$-connected. Our tools rely on the notion of dual substitution which is a geometric version of the usual notion of substitution acting on words. We associate with the fully subtractive algorithm a set of substitutions whose incidence matrix is provided by the matrices of the algorithm, and prove that their geometric counterparts generate arithmetic discrete planes.

Recommendations

• On the connecting thickness of arithmetical discrete planes
• Minimal arithmetic thickness connecting discrete planes
• On the Connectedness of Rational Arithmetic Discrete Hyperplanes
• Facet connectedness of discrete hyperplanes with zero intercept: the general case
• Connectivity of discrete planes

Cited in

(11)

• Minimal arithmetic thickness connecting discrete planes
• Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
• An output-sensitive algorithm to compute the normal vector of a digital plane
• Palindromic language of thin discrete planes
• A combinatorial approach to products of Pisot substitutions
• Decidability problems for self-induced systems generated by a substitution
• On the connecting thickness of arithmetical discrete planes
• On the Connectedness of Rational Arithmetic Discrete Hyperplanes
• Combinatorial generation of planar sets
• Approximation of digital surfaces by a hierarchical set of planar patches
• About thin arithmetic discrete planes

This page was built for publication: Critical connectedness of thin arithmetical discrete planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924464)