We study the problem of reconstructing discrete sets satisfying properties of connectivity and convexity by projections taken along many directions. The members of the class we consider are called Q-convexes. We design a polynomial time reconstruction algorithm for this class.
Brunetti, S., Daurat, A. (2000). Reconstruction of Discrete Sets From Two or More Projections in any Direction. In Proceedings of the Seventh International Workshop on Combinatorial Image Analysis (pp.241-258).
Reconstruction of Discrete Sets From Two or More Projections in any Direction
BRUNETTI, SARA;
2000-01-01
Abstract
We study the problem of reconstructing discrete sets satisfying properties of connectivity and convexity by projections taken along many directions. The members of the class we consider are called Q-convexes. We design a polynomial time reconstruction algorithm for this class.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/26094
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo