Distance functions in digital geometry (Q1091155)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance functions in digital geometry |
scientific article |
Statements
Distance functions in digital geometry (English)
0 references
1987
0 references
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.
0 references
paths
0 references
distances
0 references
variable neighborhood sequences
0 references
quantized space
0 references
shortest path
0 references
metric properties
0 references
