Dies ist eine Übersichtsseite mit Metadaten zu dieser wissenschaftlichen Arbeit. Der vollständige Artikel ist beim Verlag verfügbar.
Shortest Paths in Triangular Grids with Neighbourhood Sequences
60
Zitationen
1
Autoren
2003
Jahr
Abstract
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.
Ähnliche Arbeiten
Use of the Hough transformation to detect lines and curves in pictures
1972 · 6.521 Zit.
Efficient Graph-Based Image Segmentation
2004 · 6.188 Zit.
Statistical and structural approaches to texture
1979 · 5.739 Zit.
Watersheds in digital spaces: an efficient algorithm based on immersion simulations
1991 · 5.562 Zit.
The quickhull algorithm for convex hulls
1996 · 5.316 Zit.