Approximating the Euclidean distance using non-periodic neighbourhood sequences

DOI10.1016/j.disc.2003.12.016zbMath1076.68103OpenAlexW1983091540MaRDI QIDQ1827778

András Hajdu, Lajos Hajdu

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

zbMATH Keywords

Digital geometryEuclidean distanceDigital metricNeighbourhood sequence

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Approximating the Euclidean distance using non-periodic neighbourhood sequences