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.
Author supplied keywords
Cite
CITATION STYLE
Dutt, M., Biswas, A., & Nagy, B. (2015). Number of shortest paths in triangular grid for 1- and 2-neighborhoods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9448, pp. 115–124). Springer Verlag. https://doi.org/10.1007/978-3-319-26145-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
