Distance functions in digital geometry
type: Item
instance of: scholarly article
title: Distance functions in digital geometry
zbMATH Open document ID: 0622.68073
DOI: 10.1016/0020-0255(87)90019-3
published in: Information Sciences
publication date: 1987-01-01T00:00:00Z
review text: An analysis of paths and distances in n dimensions is carried out using variable neighborhood sequences. A symbolic expression for the distance function between any two points in this quantized space is derived. An algorithm for finding the shortest path is presented. The necessary and sufficient condition for such distance functions to satisfy the properties of a metric has been derived. Certain practical and efficient methods to check for metric properties are also presented.
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 4009849
zbMATH Keywords: paths
zbMATH Keywords: distances
zbMATH Keywords: variable neighborhood sequences
zbMATH Keywords: quantized space
zbMATH Keywords: shortest path
zbMATH Keywords: metric properties
author: Partha Pratim Das
author: P. P. Chakrabarti
author: Biswa Nath Chatterji
MaRDI profile type: Publication
full work available at URL: 0020-0255(87)90019-3
OpenAlex ID: W1974587343
cites work: Generalized distances in digital geometry
cites work: Paths and distance functions on three-dimensional digitized pictures
cites work: Digital geometry
cites work: Three-dimensional digital topology
cites work: Distance functions defined by variable neighbourhood sequences
cites work: Distances defined by neighborhood sequences
description: scientific article; zbMATH DE number 4009849