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

DOI10.1007/978-3-319-26145-4_9zbMath1486.68210OpenAlexW2296671756MaRDI QIDQ2794630

Benedek Nagy, Mousumi Dutt, Arindam Biswas

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26145-4_9

zbMATH Keywords

combinatoricstriangular gridshortest pathsdigital distances

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Non-traditional 2D grids in combinatorial imaging -- advances and challenges ⋮ Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid

This page was built for publication: Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods