Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
  • First Online:
Combinatorial Image Analysis (IWCIA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9448))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Crawley, P., Dilworth, R.P.: Algebraic Theory of Lattices. Prentice-Hall Inc., Englewood Cliffs (1973)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  3. Das, P.P.: Counting minimal paths in digital geometry. Pattern Recogn. Lett. 12(10), 595–603 (1991)

    Article  Google Scholar 

  4. Deutsch, E.S.: Thinning algorithms on rectangular, hexagonal and triangular arrays. Commun. ACM 15(3), 827–837 (1972)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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. Gruber, P.M., Lekkerkerker, C.G.: Geometry of Numbers. North-Holland Mathematical Library, vol. 37, 2nd edn. North-Holland Publishing Co., Amsterdam (1987)

    MATH  Google Scholar 

  10. Her, I.: Geometric transformations on the hexagonal grid. IEEE Trans. Image Process. 4(9), 1213–1221 (1995)

    Article  Google Scholar 

  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. Melter, R.: A survey of digital metrics. Contemp. Math. 119, 95–106 (1991)

    Article  MathSciNet  Google Scholar 

  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. Nagy, B.: Shortest path in triangular grids with neighbourhood sequences. J. Comput. Inf. Technol. 11, 111–122 (2003)

    Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  17. Nagy, B.: Generalized triangular grids in digital geometry. Acta Mathematica Academiae Paedagogicae Nyíregyháziensis. 20, 63–78 (2004)

    MATH  Google Scholar 

  18. Rosenfeld, A., Melter, R.A.: Digital geometry. Math. Intelligencer 11(3), 69–72 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  19. Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recogn. 1, 33–61 (1968)

    Article  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, International Institute of Information Technology, Naya Raipur, India

    Mousumi Dutt

  2. Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, India

    Arindam Biswas

  3. Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary

    Benedek Nagy

  4. Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, Mersin-10, Famagusta, North Cyprus, Turkey

    Benedek Nagy

Authors
  1. Mousumi Dutt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arindam Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mousumi Dutt .

Editor information

Editors and Affiliations

  1. SUNY Fredonia, Fredonia, New York, USA

    Reneta P. Barneva

  2. Advanced Computing and Microelectronics, Indian Statistical Institute, Kolkata, Germany

    Bhargab B. Bhattacharya

  3. SUNY Buffalo State, Buffalo, New York, USA

    Valentin E. Brimkov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dutt, M., Biswas, A., Nagy, B. (2015). Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods. In: Barneva, R., Bhattacharya, B., Brimkov, V. (eds) Combinatorial Image Analysis. IWCIA 2015. Lecture Notes in Computer Science(), vol 9448. Springer, Cham. https://doi.org/10.1007/978-3-319-26145-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26145-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26144-7

  • Online ISBN: 978-3-319-26145-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics