Approximating the Euclidean distance using non-periodic neighbourhood sequences
From MaRDI portal
Publication:1827778
DOI10.1016/j.disc.2003.12.016zbMath1076.68103OpenAlexW1983091540MaRDI QIDQ1827778
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.016
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Best approximation, Chebyshev systems (41A50)
Related Items (5)
Distances based on neighbourhood sequences in non-standard three-dimensional grids ⋮ Digital distance functions on three-dimensional grids ⋮ General neighborhood sequences in \(\mathbb Z^n\) ⋮ Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids ⋮ Broadcasting Automata and Patterns on ℤ2
Cites Work
- Octagonal distances for digital pictures
- Distances defined by neighborhood sequences
- Distance functions in digital geometry
- Generalized distances in digital geometry
- The \(t\)-cost distance in digital geometry
- Best simple octagonal distances in digital geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximating the Euclidean distance using non-periodic neighbourhood sequences
