Erratum to “A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry” [J. Algebra Comb. Discrete Appl. 2(3) (2015) 169-190]
Abstract
The equation (4) on the page 178 of the paper previously published has to be corrected. We had only handled the case of the Farey vertices for which $\min\left(\left\lfloor\dfrac{2m}{sr'}\right\rfloor,\left\lfloor\dfrac{n}{s'r}\right\rfloor \right)\in\mathbb{N}^{*}$. In fact we had to distinguish two cases: $\min\left(\left\lfloor\dfrac{2m {sr'}\right\rfloor,\left\lfloor\dfrac{n}{s'r}\right\rfloor \right)\in\mathbb{N}^{*}$ and $\min\left(\left\lfloor\dfrac{2m}{sr'}\right\rfloor,\left\lfloor\dfrac{n}{s'r}\right\rfloor \right)=0$. However, we highlight the correct results of the original paper and its applications. We underline that in this work, we still brought several contributions. These contributions are: applying the fundamental formulas of Graph Theory to the Farey diagram of order $(m,n)$, finding a good upper bound for the degree of a Farey vertex and the relations between the Farey diagrams and the linear diophantine equations.
Downloads
References
D. M. Acketa and J. D. Žunić, On the number of linear partitions of the $(m, n)$-grid, Inform. Process. Lett. 38(3) (1991) 163-168.
T. M. Apostol, Introduction to Analytic Number Theory, Undergraduate Texts in Mathematics, Springer-Verlag, New York (1976).
T. Asano and N. Katoh, Variants for the Hough transform for line detection, Comput. Geom. 6(4) (1996) 231-252.
C. A. Berenstein and D. Lavine, On the number of digital straight line segments, IEEE Trans. Pattern Anal. Mach. Intell. 10(6) (1988) 880-887.
J.-M. Chassery, D. Coeurjolly, and I. Sivignon, Duality and geometry straightness, characterization and envelope, in Discrete Geometry for Computer Imagery (DGCI 2006), Lecture Notes in Comput. Sci. 4245, Springer, Berlin (2006) 1-16.
J.-M. Chassery and A. Montanvert, Geometrical representation of shapes and objects for visual perception, in Geometric Reasoning for Perception and Action, Lecture Notes in Comput. Sci. 708, Springer, Berlin (1993) 163-182.
D. Coeurjolly, Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces, Thèse de doctorat, Université Lumière-Lyon II (2002).
D. Coeurjolly, I. Sivignon, F. Dupont, F. Feschet, and J.-M. Chassery, On digital plane preimage structure, Discrete Appl. Math. 151(1-3) (2005) 78-92.
A. Daurat, M. Tajine, and M. Zouaoui, About the frequencies of some patterns in digital planes: Application to area estimators, Comput. & Graphics 33(1) (2009) 11-20.
I. Debled-Rennesson, Étude et reconnaissance des droites et plans discrets, Thèse de doctorat, Université Louis Pasteur, Strasbourg (1995).
E. Domenjoud, D. Jamet, D. Vergnaud, and L. Vuillon, Enumeration formula for $(2, n)$-cubes in discrete planes, Discrete Appl. Math. 160(15) (2012) 2158-2171.
G. H. Hardy and E. M. Wright, Introduction à la théorie des nombres, Traduction de François Sauvageot, Vuibert-Springer, Paris (2007).
P. Haukkanen and J. K. Merikoski, Asymptotics of the number of threshold functions on a two-dimensional rectangular grid, Discrete Appl. Math. 161(1-2) (2013) 13-18.
A. Hatcher, Topology of Numbers, Unpublished manuscript, in preparation (2015).
W. Hou and C. Zhang, Parallel-beam CT reconstruction based on Mojette transform and compressed sensing, Int. J. Comput. Electr. Eng. 5(1) (2013) 83-87.
Y. Kenmochi, L. Buzer, A. Sugimoto, and I. Shimizu, Digital planar surface segmentation using local geometric patterns, in Discrete Geometry for Computer Imagery (DGCI 2008), Lecture Notes in Comput. Sci. 4992, Springer, Berlin (2008) 322-333.
D. Khoshnoudirad, Farey lines defining Farey diagrams and application to some discrete structures, Appl. Anal. Discrete Math. 9(1) (2015) 73-84.
A. O. Matveev, Relative blocking in posets, J. Comb. Optim. 13(4) (2007) 379-403.
A. O. Matveev, A note on Boolean lattices and Farey sequences, Integers 7 (2007) #A20.
A. O. Matveev, A note on Boolean lattices and Farey sequences II, Integers 8 (2008) #A24.
A. O. Matveev, Neighboring fractions in Farey subsequences, arXiv:0801.1981 [math.CO] (2008).
M. D. McIlroy, A note on discrete representation of lines, AT&T Tech. J. 64(2) (1985) 481-490.
E. Remy and E. Thiel, Structures dans les sphères de chanfrein, in 12e Congrès de Reconnaissance des Formes et Intelligence Artificielle (RFIA 2000), Paris (2000) 483-492.
E. Remy and E. Thiel, Exact medial axis with euclidean distance, Image Vision Comput. 23(2) (2005) 167-175.
I. Svalbe and A. Kingston, On correcting the unevenness of angle distributions arising from integer ratios lying in restricted portions of the Farey plane, in Combinatorial Image Analysis (IWCIA 2004), Lecture Notes in Comput. Sci. 3322, Springer, Berlin (2004) 110-121.
E. Szemerédi and W. T. Trotter Jr., Extremal problems in discrete geometry, Combinatorica 3(3-4) (1983) 381-392.
G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Graduate Studies in Mathematics 163, American Mathematical Society, Providence, RI (2015).
E. Thiel, Les distances de chanfrein en analyse d'images : fondements et applications, Thèse de doctorat, Université Joseph Fourier, Grenoble (1994).
E. Thiel and A. Montanvert, Chamfer masks: Discrete distance functions, geometrical properties and optimization, in Proceedings of 11th IAPR International Conference on Pattern Recognition, Vol. III, IEEE (1992) 244-247.
R. Tomás, From Farey sequences to resonance diagrams, Phys. Rev. ST Accel. Beams 17(1) (2014) 014001.
R. Tomás, Asymptotic behavior of a series of Euler's totient function $\phi(k)$ times the index of $1/k$ in a Farey sequence, ScienceOpen Research (2014) arXiv:1406.6991.
V. Trifonov, L. Pasqualucci, R. Dalla-Favera, and R. Rabadan, Fractal-like distributions over the rational numbers in high-throughput biological and clinical data, Sci. Rep. 1 (2011) 191.
