E. Barcucci, A. D. Lungo, M. Nivat, and R. Pinzani, Reconstructing convex polyominoes from horizontal and vertical projections, Theoretical Computer Science, vol.155, issue.2, pp.321-347, 1996.

S. Brunetti and A. Daurat, Reconstruction of convex lattice sets from tomographic projections in quartic time, Discrete Tomography and Digital Geometry: In memory of Attila Kuba, vol.406, pp.55-62, 2008.

P. Dulio, A. Frosini, S. Rinaldi, L. Tarsissi, and L. Vuillon, First steps in the algorithmic reconstruction of digital convex sets, Combinatorics on Words -11th International Conference, pp.164-176, 2017.

Y. Gerard, Regular switching components. Theoretical Computer Science, Special Issue in the memory of Maurice Nivat, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01832674

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.

F. William, J. H. Dowling, and . Gallier, Linear-time algorithms for testing the satisfiability of propositional horn formulae, The Journal of Logic Programming, vol.1, issue.3, pp.267-284, 1984.

Y. Gerard, Polynomial Time Reconstruction of Regular Convex Lattice Sets from their Horizontal and Vertical X-Rays, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01854636

C. Carathéodory, Uber den variabilitätsbereich der koeffizienten von potenzreihen, die gegebene werte nicht annehmen, Mathematische Annalen, vol.64, issue.1, pp.95-115, 1907.