An algorithm reconstructing convex lattice sets.

DOI10.1016/S0304-3975(03)00050-1zbMath1044.68157WikidataQ55895937 ScholiaQ55895937MaRDI QIDQ1401390

Alain Daurat, Sara Brunetti

Publication date: 17 August 2003

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

zbMATH Keywords

setsAlgorithmsConvexityDiscrete tomographyLatticeCombinatorial problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items

A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ Ghosts in discrete tomography ⋮ Characterization of hv-convex sequences ⋮ A \(Q\)-convexity vector descriptor for image analysis ⋮ Discrete Q-Convex Sets Reconstruction from Discrete Point X-Rays ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Reconstruction of convex lattice sets from tomographic projections in quartic time ⋮ Reconstruction of hv-convex sets by their coordinate X-ray functions ⋮ Determination of Q-convex sets by X-rays ⋮ Stability in discrete tomography: some positive results ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ On some geometric aspects of the class of \(hv\)-convex switching components ⋮ A Spatial Convexity Descriptor for Object Enlacement ⋮ Salient and reentrant points of discrete sets ⋮ An introduction to periodical discrete sets from a tomographical perspective ⋮ Random generation of \(Q\)-convex sets ⋮ Salient and Reentrant Points of Discrete Sets ⋮ Discrete Point X-Rays of Convex Lattice Sets ⋮ Determination of Q-convex bodies by X-rays ⋮ Reconstructing a binary matrix under timetabling constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• On the computational complexity of reconstructing lattice sets from their \(X\)-rays
• Medians of discrete sets according to a linear distance
• The reconstruction of polyominoes from their orthogonal projections
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• An efficient algorithm for determining the convex hull of a finite planar set
• Discrete tomography: Determination of finite sets by X-rays