Reconstruction of convex lattice sets from tomographic projections in quartic time

A large part of this paper is extracted from the conference article [7] which was a joint work with Attila Kuba. To our deep sorrow, Attila did not see the end of the story. This paper is dedicated to his memory
https://doi.org/10.1016/j.tcs.2008.06.003Get rights and content
Under an Elsevier user license
open archive

Abstract

Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been published giving fast implementations of these operations, and the best running time [S. Brunetti, A. Daurat, A. Kuba, Fast filling operations used in the reconstruction of convex lattice sets, in: Proc. of DGCI 2006, in: Lecture Notes in Comp. Sci., vol. 4245, 2006, pp. 98–109] is O(N2logN) time, where N is the size of projections. In this paper we improve this result by providing an implementation of the filling operations in O(N2). As a consequence, we reduce the time-complexity of the reconstruction algorithms for many classes of lattice sets having some convexity properties. In particular, the reconstruction of convex lattice sets satisfying the conditions of Gardner–Gritzmann [R.J. Gardner, P. Gritzmann, Discrete tomography: Determination of finite sets by X-rays, Trans. Amer. Math. Soc. 349 (1997) 2271–2295] can be performed in O(N4)-time.

Keywords

Discrete tomography
Convexity
Filling operations

Cited by (0)