Reconstruction of convex lattice sets from tomographic projections in quartic time

DOI10.1016/j.tcs.2008.06.003zbMath1160.68039OpenAlexW1988913080MaRDI QIDQ952457

Alain Daurat, Sara Brunetti

Publication date: 12 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.003

zbMATH Keywords

convexitydiscrete tomographyfilling operations

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Related Items (6)

Reconstruction of Convex Sets from One or Two X-rays ⋮ Regular switching components ⋮ A measure of \(Q\)-convexity for shape analysis ⋮ A \(Q\)-convexity vector descriptor for image analysis ⋮ A Spatial Convexity Descriptor for Object Enlacement ⋮ Convex Aggregation Problems in $$\mathbb {Z}^2$$

Cites Work

• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• An algorithm reconstructing convex lattice sets.
• The reconstruction of polyominoes from their orthogonal projections
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Determination of Q-convex sets by X-rays
• Discrete tomography: Determination of finite sets by X-rays
• Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
• Reconstruction of lattice sets from their horizontal, vertical and diagonal \(X\)-rays
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections

This page was built for publication: Reconstruction of convex lattice sets from tomographic projections in quartic time