Reconstruction of convex polyominoes with a blocking component

Several papers in the available literature tackled problems concerning convex polyominoes in discrete tomography. An interesting subclass consists of L-convex polyominoes, since the related reconstruction problem can have only a unique solution. On the other hand, recent studies have modeled an approach to reconstruct objects even in the case that some of the projections are unavailable, due to a particularly dense part of the scanned object, that we refer to as a blocking component. In this work we merge the two problems in order to obtain efficient reconstruction algorithms for convex and L-convex polyominoes, in case a blocking component is included.