Skoči na glavni sadržaj

Izvorni znanstveni članak

https://doi.org/10.2498/cit.2003.02.04

Shortest Paths in Triangular Grids with Neighbourhood Sequences

Benedek N Nagy


Puni tekst: engleski pdf 257 Kb

str. 111-122

preuzimanja: 1.176

citiraj


Sažetak

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.

Ključne riječi

Hrčak ID:

44760

URI

https://hrcak.srce.hr/44760

Posjeta: 1.550 *