Weighted Distances on a Triangular Grid
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.
KeywordsTriangular grid Digital distances Shortest paths Digital metrics Weighted distances Chamfer distances Distance map
Unable to display preview. Download preview PDF.
- 7.Luczak, E., Rosenfeld, A.: Distance on a hexagonal grid. Trans. on Computers C-25(5), 532–533 (1976)Google Scholar
- 8.Middleton, L., Sivaswamy, J.: Hexagonal Image Processing: A Practical Approach. Springer, London (2005)Google Scholar
- 10.Nagy, B.: Digital geometry of various grids based on neighbourhood structures. In: KEPAF 2007 – 6th Conference of Hungarian Association for Image Processing and Pattern Recognition, Debrecen, Hungary, pp. 46–53 (2007)Google Scholar
- 13.Nagy, B.: Isometric transformations of the dual of the hexagonal lattice. In: ISPA 2009 – 6th International Symposium on Image and Signal Processing and Analysis, Salzburg, Austria, pp. 432–437 (2009)Google Scholar
- 14.Nagy, B.: Distances based on neighborhood sequences in the triangular grid. In: Computational Mathematics: Theory, Methods and Applications, pp. 313–351. Nova Science Publishers (2011)Google Scholar
- 17.Russel, S.J., Norvig, P.: Artificial intelliegence: a modern approach. Prentice Hall (1995)Google Scholar
- 18.Sintorn, I.-M., Borgefors, G.: Weighted distance transforms in rectangular grids. In: ICIAP 2001, pp. 322–326 (2001)Google Scholar