Number of shortest paths in triangular grid for 1- and 2-neighborhoods

Simple item page
dc.contributor.authorDutt, Mousumi
dc.contributor.authorBiswas, Arindam
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T17:53:53Z
dc.date.issued2015
dc.departmentDoğu Akdeniz Üniversitesi
dc.description17th International Workshop on Combinatorial Image Analysis, IWCIA 2015 -- 2015-11-24 through 2015-11-27 -- Kolkata -- 160639
dc.description.abstractThis 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. © Springer International Publishing Switzerland 2015.
dc.description.sponsorshipIndian Statistical Institute, Kolkata, India; SUNY Buffalo State, Buffalo, NY, USA
dc.identifier.doi10.1007/978-3-319-26145-4_9
dc.identifier.endpage124
dc.identifier.isbn9789819698936
dc.identifier.isbn9789819698042
dc.identifier.isbn9789819698110
dc.identifier.isbn9789819698905
dc.identifier.isbn9783032004949
dc.identifier.isbn9789819512324
dc.identifier.isbn9783032026019
dc.identifier.isbn9783032008909
dc.identifier.isbn9783031915802
dc.identifier.isbn9789819698141
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-84955248609
dc.identifier.scopusqualityQ3
dc.identifier.startpage115
dc.identifier.urihttps://doi.org/10.1007/978-3-319-26145-4_9
dc.identifier.urihttps://search.trdizin.gov.tr/tr/yayin/detay/
dc.identifier.urihttps://hdl.handle.net/11129/7137
dc.identifier.volume9448
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer Verlag service@springer.de
dc.relation.ispartofLecture Notes in Computer Science
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_Scopus_20260204
dc.subjectCombinatorics
dc.subjectDigital distances
dc.subjectShortest paths
dc.subjectTriangular grid
dc.titleNumber of shortest paths in triangular grid for 1- and 2-neighborhoods
dc.typeConference Object

Files

Collections

Scopus İndeksli Yayınlar Koleksiyonu