Skip to main content
Article thumbnail
Location of Repository

Reviewed by Rachid Harba References

By Sara (i-sin-mi) Daurat, E. Barcucci, S. Brunetti, A. Del Lungo, M. Nivat, E. Barcucci, A. Del Lungo, M. Nivat and R. PinzaniE. Barcucci, A. Del Lungo, M. Nivat and R. Pinzani

Abstract

Reconstruction of convex lattice sets from tomographic projections in quartic time. (English summary) Theoret. Comput. Sci. 406 (2008), no. 1-2, 55–62. This paper proposes a fast algorithm for the reconstruction of some convex lattice sets from tomographic projections. For example, a line-convex set in both the horizontal and vertical directions is one of the possible special cases. The complexity of the algorithm is in O(N 2) compared to O(N 2 log N). For a convex set satisfying the conditions of Gardner-Gritzmann, the reconstruction can be performed in O(N 4) using the proposed method

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.1460
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.