Finding shortest path with neighbourhood sequences in triangular grids

被引：23

作者：

Nagy, B ^{[1
]}

机构：

[1] Univ Debrecen, H-4012 Debrecen, Hungary

来源：

ISPA 2001: PROCEEDINGS OF THE 2ND INTERNATIONAL SYMPOSIUM ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS | 2001年

关键词：

D O I：

10.1109/ISPA.2001.938603

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we analyse some properties of the triangular and hexagonal grids in the 2D digital space. We define distances based on the neighbouring relations that can be introduced in these grids. On the triangular grid, this can be done by the help of neighbourhood sequences. We construct a shortest path in the hexagonal grid, in a natural way. We present an algorithm, which produces for a given neighbourhood sequence a shortest path between arbitrary two points of the triangular grid, and calculate the distance of these two points, as well.

引用

页码：55 / 60

页数：6