Lower bounds for algebraic computation trees with integer inputs
SIAM Journal on Computing
Discrete analytical hyperplanes
Graphical Models and Image Processing
Thin discrete triangular meshes
Theoretical Computer Science
Object discretizations in higher dimensions
Pattern Recognition Letters
Theoretical Computer Science
Periodic graphs and connectivity of the rational digital hyperplanes
Theoretical Computer Science
About local configurations in arithmetic planes
Theoretical Computer Science
Plane digitization and related combinatorial problems
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Discrete Applied Mathematics
Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension
Discrete Applied Mathematics
Minimal arithmetic thickness connecting discrete planes
Discrete Applied Mathematics
Plane digitization and related combinatorial problems
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
On the connecting thickness of arithmetical discrete planes
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
About thin arithmetic discrete planes
Theoretical Computer Science
Determining Digital Circularity Using Integer Intervals
Journal of Mathematical Imaging and Vision
On the connectedness of rational arithmetic discrete hyperplanes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Critical connectedness of thin arithmetical discrete planes
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Hi-index | 0.00 |
Studying connectivity of discrete objects is a major issue in discrete geometry and topology. In the present work, we deal with connectivity of discrete planes in the framework of Réveillès analytical definition (Thèse d'État, Université Louis Pasteur, Strasbourg, France, 1991). Accordingly, a discrete plane is a set P(a, b, c, µ, ω) of integer points (x, y, z) satisfying the Diophantine inequalities 0 ≤ ax + by + cz + µ Z estimates the plane intercept while ω ∈ N is the plane thickness. Given three integers (plane coefficients) a, b, and c with 0 ≤ a ≤ b ≤ c, one can seek the value of ω beyond which the discrete plane P(a, b, c, µ, ω) is always connected. We call this remarkable topological invariable the connectivity number of P(a, b, c, µ, ω) and denote it Ω(a, b, c). Despite several attempts over the last 10 years to determine the connectivity number, this is still an open question. In the present paper, we propose a solution to the problem. For this, we first investigate some combinatorial properties of discrete planes. These structural results facilitate the deeper understanding of the discrete plane structure. On this basis, we obtain a series of results, in particular, we provide an explicit solution to the problem under certain conditions. We also obtain exact upper and lower bounds on Ω(a, b, c) and design an O(alogb) algorithm for its computation.