Distances defined by neighborhood sequences
type: Item
instance of: scholarly article
title: Distances defined by neighborhood sequences
zbMATH Open document ID: 0602.68088
DOI: 10.1016/0031-3203(86)90014-2
author: Masafumi Yamashita
author: Toshihide Ibaraki
published in: Pattern Recognition
publication date: 1986-01-01T00:00:00Z
review text: In this paper the general properties of distance functions over digitized space are discussed. It is assumed that a distance between two points is defined as the length of the shortest path connecting them in the underlying graph which is defined by a given neighborhood sequence. A necessary and sufficient condition for a neighborhood sequence to define a distance function is derived. The problem of how tight such distances can approximate the Euclid distance is also discussed.
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 3972239
zbMATH Keywords: path length
zbMATH Keywords: distance functions
zbMATH Keywords: digitized space
zbMATH Keywords: neighborhood sequence
zbMATH Keywords: Euclid distance
MaRDI profile type: Publication
full work available at URL: 0031-3203(86)90014-2
OpenAlex ID: W2047250593
cites work: Path generated digital metrics
cites work: Digital metrics: A graph-theoretical approach
cites work: Paths and distance functions on three-dimensional digitized pictures
cites work: Distance functions defined by variable neighbourhood sequences
description: scientific article; zbMATH DE number 3972239