Shortest Paths in Triangular Grids with Neighbourhood Sequences

摘要

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...