Periodica Mathematica Hungarica

, Volume 79, Issue 2, pp 177–190

# On the taxicab distance sum function and its applications in discrete tomography

Article

## Abstract

Let a finite set $$F\subset \mathbb {R}^n$$ be given. The taxicab distance sum function is defined as the sum of the taxicab distances from the elements (focuses) of the so-called focal set F. The sublevel sets of the taxicab distance sum function are called generalized conics because the boundary points have the same average taxicab distance from the focuses. In case of a classical conic (ellipse) the focal set contains exactly two different points and the distance taken to be averaged is the Euclidean one. The sublevel sets of the taxicab distance sum function can be considered as its generalizations. We prove some geometric (convexity), algebraic (semidefinite representation) and extremal (the problem of the minimizer) properties of the generalized conics and the taxicab distance sum function. We characterize its minimizer and we give an upper and lower bound for the extremal value. A continuity property of the mapping sending a finite subset F to the taxicab distance sum function is also formulated. Finally we present some applications in discrete tomography. If the rectangular grid determined by the coordinates of the elements in $$F\subset \mathbb {R}^2$$ is given then the number of points in F along the directions parallel to the sides of the grid is a kind of tomographic information. We prove that it is uniquely determined by the function measuring the average taxicab distance from the focal set F and vice versa. Using the method of the least average values we present an algorithm to reconstruct F with a given number of points along the directions parallel to the sides of the grid.

## Keywords

Taxicab distance Generalized conics Discrete and geometric tomography

## Mathematics Subject Classification

Primary 52A40 Secondary 52A41

## References

1. 1.
A. Alpers, H.F. Poulsen, E. Knudsen, G.T. Herman, A discrete tomography algorithm for improving the quality of 3DXRD grain maps. J. Appl. Crystallogr. 39, 582–588 (2006)
2. 2.
P. Balázs, A benchmark set for the reconstruction of hv-convex discrete sets. Discrete Appl. Math. 157, 3447–3456 (2009)
3. 3.
E. Balogh, A. Kuba, C. Dévényi, A. Del Lungo, R. Pinzani, Comparison of algorithms for reconstructing hv-convex discrete sets. Linear Algebra Appl. 339, 23–35 (2001)
4. 4.
E. Barcucci, A. Del Lungo, M. Nivat, R. Pinzani, Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput. Sci. 155, 321–347 (1996)
5. 5.
K.J. Batenburg, J. Sijbers, DART: a practical reconstruction algorithm for discrete tomography. IEEE Trans. Image Process. 20(9), 2542–2553 (2011)
6. 6.
K.J. Batenburg, J. Sijbers, Generic iterative subset algorithms for discrete tomography. Discrete Appl. Math. 157(3), 438–451 (2009)
7. 7.
S. Brunetti, P. Dulio, C. Peri, Discrete tomography determination of bounded lattice sets from four X-rays. Discrete Appl. Math. 161(15), 2281–2292 (2013)
8. 8.
P.C. Fishburn, L.A. Shepp, Sets of uniqueness and additivity in integer lattices, in Discrete Tomography: Foundations, Algorithms and Applications, ed. by G.T. Herman, A. Kuba (Birkhuser, Boston, 1999), pp. 35–58
9. 9.
R.J. Gardner, P. Gritzmann, Uniqueness and complexity in discrete tomography, in Discrete Tomography: Foundations, Algorithms and Applications, ed. by G.T. Herman, A. Kuba (Birkhuser, Boston, 1999), pp. 85–113
10. 10.
R.J. Gardner, Geometric Tomography, 2nd edn. (Cambridge University Press, New York, 2006)
11. 11.
P. Gritzmann, B. Langfeld, M. Wiegelmann, Uniqueness in discrete tomography: three remarks and a corollary. SIAM J. Discrete Math. 25, 1589–1599 (2011)
12. 12.
P. Gritzmann, S. de Vries, M. Wiegelmann, Approximating binary images from discrete X-rays. SIAM J. Optim. 11(2), 522–546 (2000)
13. 13.
L. Hajdu, R. Tijdeman, Algebraic aspects of discrete tomography. J. Reine Angew. Math. 534, 119–128 (2001)
14. 14.
L. Hajdu, R. Tijdeman, An algorithm for discrete tomography. J. Linear Algebra 339, 147–169 (2001)
15. 15.
L. Hajdu, Unique reconstruction of bounded sets in discrete tomography. Electron. Notes Discrete Math. 20, 15–25 (2005)
16. 16.
G.T. Herman, Reconstruction of binary patterns from a few projections, in International Computing Symposium 1973, 371–378, ed. by A. Günther, B. Levrat, H. Lipps (North-Holland, Amsterdam, 1974)Google Scholar
17. 17.
J. Nie, P.A. Parillo, B. Sturmfels, Semidefinite representation of $k$-ellipse, algorithms in algebraic geometry. IMA Vol. Math. Appl. 146, 117–132 (2008)Google Scholar
18. 18.
L. Rodek, H.F. Poulsen, E. Knudsen, G.T. Herman, A stochastic algorithm for reconstruction of grain maps of moderately deformed specimens based on X-ray diffraction. J. Appl. Crystallogr. 40, 313–321 (2007)
19. 19.
H.J. Ryser, Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9, 371–377 (1957)
20. 20.
H.J. Ryser, Matrices of zeros and ones Bull. Am. Math. Soc. 66(6), 442–464 (1960)
21. 21.
W. van Aarle, K.J. Batenburg, J. Sijbers, Automatic parameter estimation for the Discrete Algebraic Reconstruction Technique (DART). IEEE Trans. Image Process. 21(11), 4608–4621 (2012)
22. 22.
C. Vincze, Á. Nagy, An introduction to the theory of generalized conics and their applications. J. Geom. Phys. 61(4), 815–828 (2011)
23. 23.
C. Vincze, Á. Nagy, On the theory of generalized conics with applications in geometric tomography. J. Approx. Theory 164, 371–390 (2012)
24. 24.
C. Vincze, Á. Nagy, Generalized conic functions of hv-convex planar sets: continuity properties and X-rays. Aequationes mathematicae 89(4), 1015–1030 (2015)
25. 25.
C. Vincze, Á. Nagy, Reconstruction of hv-convex sets by their coordinate X-ray functions. J. Math. Imaging Vis. 49(3), 569–582 (2014)
26. 26.
C. Vincze, Á. Nagy, An algorithm for the reconstruction of hv-convex planar bodies by finitely many and noisy measurements of their coordinate X-rays. Fundamenta Informaticae 141(2–3), 169–189 (2015)