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.
On Some Geometric Aspects of the Class of hv-Convex Switching Components
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
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.