Generalized distances in digital geometry
From MaRDI portal
Publication:1095667
DOI10.1016/0020-0255(87)90015-6zbMath0632.68067OpenAlexW1974763083MaRDI QIDQ1095667
Biswa Nath Chatterji, Partha Pratim Chakrabarti, Partha Pratim Das
Publication date: 1987
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(87)90015-6
shortest pathdistance metricgeneralized distance measurem-neighbour distancequantized n- dimensional space
Related Items (18)
Distance functions in digital geometry ⋮ The discrete version of a geometric duality theorem ⋮ Metric subgraphs of the chamfer metrics and the Melter-Tomescu path generated metrics ⋮ Distances based on neighbourhood sequences in non-standard three-dimensional grids ⋮ Weighted distances and digital disks on the Khalimsky grid. Disks with holes and islands ⋮ Non-traditional 2D grids in combinatorial imaging -- advances and challenges ⋮ Hyperspheres in digital geometry ⋮ The \(t\)-cost distance in digital geometry ⋮ General neighborhood sequences in \(\mathbb Z^n\) ⋮ Distance with generalized neighbourhood sequences in \(n D\) and \(\infty D\) ⋮ A note on ``Distance functions in digital geometry ⋮ Application of neighborhood sequences in communication of hexagonal networks ⋮ Linear hypertree for multi-dimensional image representation ⋮ Estimation of errors between Euclidean and m-neighbor distance ⋮ Weighted distances based on neighborhood sequences for point-lattices ⋮ Broadcasting Automata and Patterns on ℤ2 ⋮ Approximating the Euclidean distance using non-periodic neighbourhood sequences ⋮ The t-cost-m-neighbour distance in digital geometry
Cites Work
This page was built for publication: Generalized distances in digital geometry
