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

DOI10.1007/978-3-319-26145-4_9MaRDI QIDQ2794630zbMATH OpenOpenAlexFDO

Authors Mousumi Dutt, Arindam Biswas, Benedek Nagy

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

combinatoricsdigital distancesshortest pathstriangular grid

Mathematics Subject Classification ID

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

Recommendations

• On the number of shortest paths by neighborhood sequences on the square grid
• The number of shortest paths in the arrangement graph
• On approximating shortest paths in weighted triangular tessellations
• On approximating shortest paths in weighted triangular tessellations
• An algorithm for finding the number of shortest routes on square lattices
• The Number of Shortest Paths on the Surface of a Polyhedron
• Approximating the longest paths in grid graphs
• Shortest paths in Sierpiński graphs
• Using shortcut edges to maximize the number of triangles in graphs
• Enumerating triangulation paths

Cited in

(5)

• Counting minimal 18-paths in 3D digital space
• On the number of shortest paths by neighborhood sequences on the square grid
• Convex and concave vertices on a simple closed curve in the triangular grid
• An Arithmetic Triangle Arising From a One-Way Street Grid
• Non-traditional 2D grids in combinatorial imaging -- advances and challenges

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794630)