โ Scribed by Timothy A Anderson; Chul E Kim
No coin nor oath required. For personal study only.
A period on digital line segments is defined. It is shown that each of the two nearest supports contains a preimage of the digital line segment and at least one of them contains two points of the digital line segment. Linear time algorithms are presented which find the nearest support of a 2-D digital line segment, four and eight parameters that represent 2-D and 3-D digital line segments, respectively, and construct the complete set of preimages of 2-D and 3-D digital line segments.
๐ SIMILAR VOLUMES
In past studies, the digital straight-line segment is defined as a figure approximating the straight-line segment in the continuous space, by grid points in the discrete space. Because of this definition, the properties of the segment vary depending on the approximation process, which prevented the
A recursive algorithm for the computation of the Euler characteristic 5, the volume V, the surface S, the mean width M, and other properties (i.e., quermassintegrals) of digital pictures is presented. Full generality with respect to dimension is achieved by understanding digital pictures as (nondege