Combinatorics of the Gauss Digitization Under Translation in 2D

The action of a translation on a continuous object before its digitization generates several digital objects. This paper focuses on the combinatorics of the generated digital objects up to integer translations. In the general case, a worst-case upper bound is exhibited and proved to be reached on an example. Another upper bound is also proposed by making a link between the number of the digital objects and the boundary curve, through its self-intersections on the torus. An upper bound, quadratic in digital perimeter, is then derived in the convex case and eventually an asymptotic upper bound, quadratic in the grid resolution, is exhibited in the polygonal case. A few significant examples finish the paper.