Critical Connectedness of Thin Arithmetical Discrete Planes

DOI10.1007/978-3-642-37067-0_10zbMath1382.68246arXiv1312.7820OpenAlexW1753400428MaRDI QIDQ4924464

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

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)

Related Items (7)

An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Palindromic language of thin discrete planes ⋮ Decidability Problems for Self-induced Systems Generated by a Substitution ⋮ Combinatorial generation of planar sets ⋮ Approximation of digital surfaces by a hierarchical set of planar patches ⋮ Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words ⋮ A combinatorial approach to products of Pisot substitutions

This page was built for publication: Critical Connectedness of Thin Arithmetical Discrete Planes