# About the Reconstruction of Convex Lattice Sets from One or Two X-rays

We consider a class of problems of Discrete Tomography which has been deeply investigated in the past: the reconstruction of convex lattice sets from their horizontal and/or vertical X-rays, i.e. from the number of points in a sequence of consecutive horizontal and vertical lines. The reconstruction of the HV-convex polyominoes works usually in two steps, first the filling step consisting in filling operations, second the convex aggregation of the switching components. We prove three results about the convex aggregation step: (1) The convex aggregation step used for the reconstruction of HV-convex polyominoes does not always provide a solution. The example yielding to this result is called the bad guy and disproves a conjecture of the domain. (2) The reconstruction of a digital convex lattice set from only one X-ray can be performed in polynomial time. We prove it by encoding the convex aggregation problem in a Directed Acyclic Graph. (3) With the same strategy, we prove that the reconstruction of fat digital convex sets from their horizontal and vertical X-rays can be solved in polynomial time. Fatness is a property of the digital convex sets regarding the relative position of the left, right, top and bottom points of the set. The complexity of the reconstruction of the lattice sets which are not fat remains an open question.

research
12/13/2018

### Peeling Digital Potatoes

The potato-peeling problem (also known as convex skull) is a fundamental...
research
01/15/2019

### Efficient Algorithms to Test Digital Convexity

A set S ⊂Z^d is digital convex if conv(S) ∩Z^d = S, where conv(S) denote...
research
12/11/2020

### On some geometric aspects of the class of hv-convex switching components

In the usual aim of discrete tomography, the reconstruction of an unknow...
research
03/08/2021

### Digital Convex + Unimodular Mapping =8-Connected (All Points but One 4-Connected)

In two dimensional digital geometry, two lattice points are 4-connected ...
research
04/15/2020

### Efficient Algorithms for Battleship

We consider an algorithmic problem inspired by the Battleship game. In t...
research
10/20/2020

### Sparse reconstruction in spin systems I: iid spins

For a sequence of Boolean functions f_n : {-1,1}^V_n⟶{-1,1}, defined on ...
research
06/27/2020

### On Dualization over Distributive Lattices

Given a partially order set (poset) P, and a pair of families of ideals ...