Object digitization up to a translation.

This paper presents a study on the set of the digitizations generated by all the translations of a planar body on a square grid. First the translation vector set is reduced to a bounded subset, then the dual introduced in [1] linking the translation vector to the corresponding digitization is proved to be piecewise constant. Finally, a new algorithm is proposed to compute the digitization set using the dual. [ABSTRACT FROM AUTHOR]