Best simple octagonal distances in digital geometry
From MaRDI portal
Publication:1185937
DOI10.1016/0021-9045(92)90090-BzbMath0748.41014MaRDI QIDQ1185937
Publication date: 28 June 1992
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Distance in graphs (05C12) Approximation by other special function classes (41A30) Real and complex geometry (51M99)
Related Items (8)
Distances based on neighbourhood sequences in non-standard three-dimensional grids ⋮ Non-traditional 2D grids in combinatorial imaging -- advances and challenges ⋮ Digital distance functions on three-dimensional grids ⋮ The \(t\)-cost distance in digital geometry ⋮ General neighborhood sequences in \(\mathbb Z^n\) ⋮ Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids ⋮ Approximating the Euclidean distance using non-periodic neighbourhood sequences ⋮ Parallel distance transforms on a linear array architecture
Cites Work
This page was built for publication: Best simple octagonal distances in digital geometry
