General neighborhood sequences in \(\mathbb Z^n\)

DOI10.1016/j.dam.2007.06.021zbMath1131.68111OpenAlexW2140177303MaRDI QIDQ2462388

Lajos Hajdu, András Hajdu, Robert Tijdeman

Publication date: 30 November 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.06.021

zbMATH Keywords

geometric algorithmscombinatorial algorithmsimage processing and computer visionlanguages and systemspath and circuit problems

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Related Items (4)

Digital distance functions on three-dimensional grids ⋮ Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid ⋮ Distance transform computation for digital distance functions ⋮ Weighted distances based on neighborhood sequences for point-lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Octagonal distances for digital pictures
• Hyperspheres in digital geometry
• Distances defined by neighborhood sequences
• Distance functions in digital geometry
• Generalized distances in digital geometry
• Best simple octagonal distances in digital geometry
• Estimation of errors between Euclidean and m-neighbor distance
• Approximating the Euclidean distance using non-periodic neighbourhood sequences
• Approximation of the Euclidean Distance by Chamfer Distances

This page was built for publication: General neighborhood sequences in \(\mathbb Z^n\)