Generalized distances in digital geometry
Information Sciences: an International Journal
Distance functions in digital geometry
Information Sciences: an International Journal
Octagonal distances for digital pictures
Information Sciences: an International Journal
Hyperspheres in digital geometry
Information Sciences: an International Journal
Geometry of neighbourhood sequences
Pattern Recognition Letters
Distances with neighbourhood sequences in cubic and triangular grids
Pattern Recognition Letters
Generating distance maps with neighbourhood sequences
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Approximating non-metrical Minkowski distances in 2D
Pattern Recognition Letters
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Digital distance functions on three-dimensional grids
Theoretical Computer Science
On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension
Pattern Recognition Letters
Calculating distance with neighborhood sequences in the hexagonal grid
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Approximation of the euclidean distance by Chamfer distances
Acta Cybernetica
Linear combination of weighted t-cost and chamfering weighted distances
Pattern Recognition Letters
| Hi-index | 0.05 |
In this paper we generalize some former results of Das et al. about distances with n-dimensional periodic neighbourhood sequences. We use a more general definition of neighbourhood sequences, which does not require periodicity. As an extension of the earlier results, we give a formula to calculate the distance between two arbitrary points with general neighbourhood sequences in an arbitrary finite dimension. Moreover we extend the result to the infinite-dimensional digital space.