Shortest Paths in Triangular Grids with Neighbourhood Sequences

Benedek N Nagy


In this paper we analyse some properties of the triangular and hexagonal grids in the 2D digital space. We define distances based on neighbourhood relations that can be introduced in these grids. We present an algorithm, which calculates the distance from an arbitrary point to another one for a given neighbourhood sequence in the triangular grid. Moreover, this algorithm produces a shortest path between these points, as well.

Full Text:



Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj

 Hrvatski arhiv weba logo