ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Sciences
Volume 42, Issue 1, June 1987, Pages 51-67
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (696 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0020-0255(87)90015-6    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1987 Published by Elsevier Science Inc.

Generalized distances in digital geometry

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

P. P. Das

P. P. Chakrabarti

B. N. Chatterji

Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur 121302, India

Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur-721302, India

Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur-721302, India


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.

Article Outline

• References

Information Sciences
Volume 42, Issue 1, June 1987, Pages 51-67
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.