Combinatorial pieces in digital lines and planes
Jean-Pierre Reveillès · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1995
In this paper we give an answer to the problem of enumerating the combinatorially distinct segments of given length in digital lines and rectangular blocks of given shape in digital planes. We also give a formula to locate a precise piece and study the distribution of all segments of digital lines. We deduce from these results a very simple algorithm to recognize the normal vector of a digital plane.