Elsevier

Information Sciences

Volume 42, Issue 2, July 1987, Pages 113-136
Information Sciences

Distance functions in digital geometry

https://doi.org/10.1016/0020-0255(87)90019-3Get rights and content

Abstract

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.

References (8)

There are more references available in the full text version of this article.

Cited by (0)

View full text