hrcak mascot   Srce   HID

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: 912* citiraj
APA 6th Edition
Nagy, B.N. (2003). Shortest Paths in Triangular Grids with Neighbourhood Sequences. Journal of computing and information technology, 11 (2), 111-122. https://doi.org/10.2498/cit.2003.02.04
MLA 8th Edition
Nagy, Benedek N. "Shortest Paths in Triangular Grids with Neighbourhood Sequences." Journal of computing and information technology, vol. 11, br. 2, 2003, str. 111-122. https://doi.org/10.2498/cit.2003.02.04. Citirano 08.03.2021.
Chicago 17th Edition
Nagy, Benedek N. "Shortest Paths in Triangular Grids with Neighbourhood Sequences." Journal of computing and information technology 11, br. 2 (2003): 111-122. https://doi.org/10.2498/cit.2003.02.04
Harvard
Nagy, B.N. (2003). 'Shortest Paths in Triangular Grids with Neighbourhood Sequences', Journal of computing and information technology, 11(2), str. 111-122. https://doi.org/10.2498/cit.2003.02.04
Vancouver
Nagy BN. Shortest Paths in Triangular Grids with Neighbourhood Sequences. Journal of computing and information technology [Internet]. 2003 [pristupljeno 08.03.2021.];11(2):111-122. https://doi.org/10.2498/cit.2003.02.04
IEEE
B.N. Nagy, "Shortest Paths in Triangular Grids with Neighbourhood Sequences", Journal of computing and information technology, vol.11, br. 2, str. 111-122, 2003. [Online]. https://doi.org/10.2498/cit.2003.02.04

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.

Hrčak ID: 44760

URI
https://hrcak.srce.hr/44760

Posjeta: 1.155 *