Advertisement

Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods

  • Mousumi DuttEmail author
  • Arindam Biswas
  • Benedek Nagy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9448)

Abstract

This paper presents a novel formulation to determine the number of shortest paths between two points in triangular grid in 2D digital space. Three types of neighborhood relations are used on the triangular grid. Here, we present the solution of the above mentioned problem for two neighborhoods—1-neighborhood and 2-neighborhood. To solve the stated problem we need the coordinate triplets of the two points. This problem has theoretical aspects and practical importance.

Keywords

Triangular grid Digital distances Shortest paths Combinatorics 

References

  1. 1.
    Crawley, P., Dilworth, R.P.: Algebraic Theory of Lattices. Prentice-Hall Inc., Englewood Cliffs (1973)zbMATHGoogle Scholar
  2. 2.
    Das, P.P.: An algorithm for computing the number of the minimal paths in digital images. Pattern Recogn. Lett. 9(2), 107–116 (1989)zbMATHCrossRefGoogle Scholar
  3. 3.
    Das, P.P.: Counting minimal paths in digital geometry. Pattern Recogn. Lett. 12(10), 595–603 (1991)CrossRefGoogle Scholar
  4. 4.
    Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal and triangular arrays. Commun. ACM 15(3), 827–837 (1972)CrossRefGoogle Scholar
  5. 5.
    Dutt, M., Biswas, A., Bhattacharya, B.B.: Enumeration of shortest isothetic paths inside a digital object. In: Kryszkiewicz, M., Bandyopadhyay, S., Rybinski, H., Pal, S.K. (eds.) PReMI 2015. LNCS, vol. 9124, pp. 105–115. Springer, Heidelberg (2015) CrossRefGoogle Scholar
  6. 6.
    Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On finding shortest isothetic path inside a digital object. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 1–15. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  7. 7.
    Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B.: On finding a shortest isothetic path and its monotonicity inside a digital object. Annals of Mathematics and Artificial Intelligence (2014) (in press)Google Scholar
  8. 8.
    Gruber, P.M.: Geometry of numbers. In: Gruber, P.M., Wills, J.M. (eds.) Handbook of Convex Geometry, vol. B, pp. 739–763. Elsevier, Amsterdam (1993) Google Scholar
  9. 9.
    Gruber, P.M., Lekkerkerker, C.G.: Geometry of Numbers. North-Holland Mathematical Library, vol. 37, 2nd edn. North-Holland Publishing Co., Amsterdam (1987) zbMATHGoogle Scholar
  10. 10.
    Her, I.: Geometric transformations on the hexagonal grid. IEEE Trans. Image Process. 4(9), 1213–1221 (1995)CrossRefGoogle Scholar
  11. 11.
    Lekkerkerker, C.G.: Geometry of numbers. Bibliotheca Mathematica, vol. VIII. Wolters-Noordhoff Publishing, Groningen, North-Holland Publishing Co., Amsterdam, London (1969)Google Scholar
  12. 12.
    Melter, R.: A survey of digital metrics. Contemp. Math. 119, 95–106 (1991)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Nagy, B.: A family of triangular grids in digital geometry. In: Proceedings of the 3rd International Symposium on Image and Signal Processing and Analysis, ISPA 2003, vol. 1, pp. 101–106. Italy, Rome (2003)Google Scholar
  14. 14.
    Nagy, B.: Shortest path in triangular grids with neighbourhood sequences. J. Comput. Inf. Technol. 11, 111–122 (2003)Google Scholar
  15. 15.
    Nagy, B.: Isometric transformations of the dual of the hexagonal lattice. In: Proceedings of the 6th International Symposium on Image and Signal Processing and Analysis, ISPA 2009. pp. 432–437. IEEE, Salzburg, Austria (2009)Google Scholar
  16. 16.
    Nagy, B.: Weighted distances on a triangular grid. In: Barneva, R.P., Brimkov, V.E., Šlapal, J. (eds.) IWCIA 2014. LNCS, vol. 8466, pp. 37–50. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  17. 17.
    Nagy, B.: Generalized triangular grids in digital geometry. Acta Mathematica Academiae Paedagogicae Nyíregyháziensis. 20, 63–78 (2004)zbMATHGoogle Scholar
  18. 18.
    Rosenfeld, A., Melter, R.A.: Digital geometry. Math. Intelligencer 11(3), 69–72 (1989)zbMATHMathSciNetCrossRefGoogle Scholar
  19. 19.
    Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recogn. 1, 33–61 (1968)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Wüthrich, C.A., Stucki, P.: An algorithmic comparison between square- and hexagonal-based grids. CVGIP: Graphical Models Image Process. 53, 324–339 (1991)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringInternational Institute of Information TechnologyNaya RaipurIndia
  2. 2.Department of Information TechnologyIndian Institute of Engineering Science and TechnologyShibpurIndia
  3. 3.Department of Computer Science, Faculty of InformaticsUniversity of DebrecenDebrecenHungary
  4. 4.Department of Mathematics, Faculty of Arts and SciencesEastern Mediterranean UniversityFamagustaTurkey

Personalised recommendations