Distance functions in digital geometry (Q1091155): Difference between revisions

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.