Copyright © 1987 Published by Elsevier Science Inc.
Generalized distances in digital geometry
Received 7 May 1986;
revised 13 December 1986.
Available online 20 May 2003.
Abstract
A generalized distance measure called m-neighbor distance in n-D quantized space is presented. Its properties as a metric are examined. It is shown to give the shortest path length between two points in n-D digital space. An algorithm for finding such a shortest path between two points is presented. It is shown that lower dimension (2-D and 3-D) distance measures presently used in digital geometry can easily be derived as special cases. Other properties of m-neighbor distance are also examined.






E-mail Article
Add to my Quick Links

Cited By in Scopus (17)





