Reconstruction of digital convex lattice sets from one X-ray and fat ones from two X-rays is polynomial-time solvable via DAG encoding, with a counterexample disproving a conjecture on HV-convex polyomino aggregation.
Discrete tomography: Foundations, a lgorithms, and applications
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2022 2verdicts
UNVERDICTED 2representative citing papers
Fewer than d/2 errors in line sums can be corrected in discrete tomography, with the bound shown to be optimal.
citing papers explorer
-
Reconstruction of Convex Sets from One or Two X-rays
Reconstruction of digital convex lattice sets from one X-ray and fat ones from two X-rays is polynomial-time solvable via DAG encoding, with a counterexample disproving a conjecture on HV-convex polyomino aggregation.
-
Error Correction for Discrete Tomography
Fewer than d/2 errors in line sums can be corrected in discrete tomography, with the bound shown to be optimal.