The t-cost-m-neighbour distance in digital geometry

DOI10.1007/BF01231867zbMath0732.68097OpenAlexW2094855224MaRDI QIDQ808735

Biswa Nath Chatterji, Partha Pratim Chakrabarti, Partha Pratim Das

Publication date: 1991

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01231867

zbMATH Keywords

shortest pathdistance metricgeneralized distance measuret-Cost-m-Neighbour distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Distances defined by neighborhood sequences
• Generalized distances in digital geometry
• The \(t\)-cost distance in digital geometry
• Three-dimensional digital topology
• Sequential Operations in Digital Picture Processing

This page was built for publication: The t-cost-m-neighbour distance in digital geometry