Octagonal distances for digital pictures (Q751867)

The paper studies a set of distances in the two-dimensional digital plane resulting from combinations of 4-distance (cityblock metric) and 8- distance (chessboard metric). Each distance type is generated by shortest-path motions determined by a sequence of transitions to either a 3-neighbor or to a 8-neighbor in a predetermined periodic succession. The study is motivated by a desire to obtain approximations to the Euclidean disk better than cityblock or chessboard ones. Digital disks of the considered distances are shown to be digital octagons. A necessary and sufficient condition for these distances to be metric are given. The relative perimeter and area errors of their disks with respect to the Euclidean one are calculated.