Approximating the Euclidean distance using non-periodic neighbourhood sequences

DOI10.1016/J.DISC.2003.12.016zbMATH Open1076.68103OpenAlexW1983091540MaRDI QIDQ1827778FDOQ1827778

Authors: 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

Recommendations

• Approximating the Euclidean circle in the square grid using neighbourhood sequences
• scientific article; zbMATH DE number 2099143
• scientific article; zbMATH DE number 2065282
• Distances defined by neighborhood sequences
• Approximation of the Euclidean distance by chamfer distances

zbMATH Keywords

Euclidean distanceDigital geometryDigital metricNeighbourhood sequence

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Best approximation, Chebyshev systems (41A50)

Cites Work

• Title not available (Why is that?)
• Distances defined by neighborhood sequences
• Distance functions in digital geometry
• Generalized distances in digital geometry
• Best simple octagonal distances in digital geometry
• Octagonal distances for digital pictures
• The \(t\)-cost distance in digital geometry
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Discrete euclidean metrics
• Determining Cosine Similarity Neighborhoods by Means of the Euclidean Distance
• Path-based distance functions in \(n\)-dimensional generalizations of the face- and body-centered cubic grids
• Estimation of errors between Euclidean and m-neighbor distance
• Polygon approximations of the Euclidean circles on the square grid by broadcasting sequences
• Broadcasting automata and patterns on \(\mathbb{Z}^2\)
• Digital distance functions on three-dimensional grids
• Distances based on neighbourhood sequences in non-standard three-dimensional grids
• Approximating the Euclidean circle in the square grid using neighbourhood sequences
• General neighborhood sequences in \(\mathbb Z^n\)
• Approximation of Euclidean metric by digital distances

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827778)