Mukherjee,Jayanta, Kumar A., Das,P.P. and Chatterji,B.N. (2000):
On approximating Euclidean metrics by digital distances in 2D and 3D,
Pattern Recognition Letters, 21, 573-582.  Abstract. 
In this paper a geometric approach is suggested to find the closest approximation to Euclidean metric based on geometric measures of the digital circles in 2D and the digital spheres in 3D for the generalised octagonal distances. First we show that the vertices of the digital circles (spheres) for octagonal distances can be suitably approximated as a function of the number of neighborhood types used in the sequence. Then we used these approximate vertex formulae to compute the geometric features in an approximate way. Finally we minimize the errors of these measurements with respect to respective Euclidean discs to identify the best distances. We have verified our results by experimenting with analytical error measures suggested earlier. We have also compared the performances of the good octagonal distances with good weighted distances. It has been found that the best octagonal distance in 2D ( {1,1,2}) performs equally good with respect to the best one for the weighted distances (<3,4>). In fact in 3D, the octagonal distance {1,1,3} has an edge over the other good weighted distances.