Distances defined by neighborhood sequences (Q1082093): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:47, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distances defined by neighborhood sequences |
scientific article |
Statements
Distances defined by neighborhood sequences (English)
0 references
1986
0 references
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.
0 references
path length
0 references
distance functions
0 references
digitized space
0 references
neighborhood sequence
0 references
Euclid distance
0 references