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

DOI10.1007/BF01231867zbMATH Open0732.68097OpenAlexW2094855224MaRDI QIDQ808735FDOQ808735

Authors: Partha Pratim Das, P. P. Chakrabarti, Biswa Nath Chatterji 

Publication date: 1991

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

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

Recommendations

• The \(t\)-cost distance in digital geometry
• Generalized distances in digital geometry
• Distances defined by neighborhood sequences
• A note on ``Distance functions in digital geometry
• scientific article; zbMATH DE number 2099143

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Generalized distances in digital geometry

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

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