Paper Info
Title
Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods.
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.
Year
DOI
Venue
2015
10.1007/978-3-319-26145-4_9
IWCIA
Field
DocType
Citations 
Discrete mathematics,Mathematical optimization,Algebra,Computer science,Triangular grid
Conference
2
PageRank 
References 
Authors
0.37
4
3
Name
Order
Citations
PageRank
Mousumi Dutt1258.54
Arindam Biswas214135.89
Benedek Nagy331451.98