Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
