In this paper we introduce weighted distances on a triangular grid. Three types of neighborhood relations are used on the grid, and therefore three weights are used to define a distance function. Some properties of the weighted distances, including metrical properties are discussed. We also give algorithms that compute the weighted distance of any point-pair on a triangular grid. Formulae for computing the distance are also given. Therefore the introduced new distance functions are ready for application in image processing and other fields. © 2014 Springer International Publishing.
CITATION STYLE
Nagy, B. (2014). Weighted distances on a triangular grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8466 LNCS, pp. 37–50). Springer Verlag. https://doi.org/10.1007/978-3-319-07148-0_5
Mendeley helps you to discover research relevant for your work.