GENERALIZED DISTANCES IN DIGITAL GEOMETRY

被引:48
作者
DAS, PP [1 ]
CHAKRABARTI, PP [1 ]
CHATTERJI, BN [1 ]
机构
[1] INDIAN INST TECHNOL,DEPT COMP SCI & ENGN,KHARAGPUR 721302,W BENGAL,INDIA
关键词
COMPUTER PROGRAMMING - Algorithms - MATHEMATICAL TECHNIQUES - Geometry;
D O I
10.1016/0020-0255(87)90015-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:51 / 67
页数:17
相关论文
共 8 条
[1]  
BORGEFORS G, 1984, COMPUT VISION GRAPH, V27, P333
[2]  
DAS PP, IN PRESS INFORM SCI
[3]   THE M-DIMENSIONAL GRID POINT SPACE [J].
KLETTE, R .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 30 (01) :1-12
[4]  
KNUTH DE, 1982, ART COMPUTER PROGRAM, V1, P37
[5]   Paths and distance functions on three-dimensional digitized pictures [J].
Okabe, Naoki ;
Toriwaki, Jun-ichiro ;
Fukumura, Teruo .
PATTERN RECOGNITION LETTERS, 1983, 1 (04) :205-212
[6]   3-DIMENSIONAL DIGITAL-TOPOLOGY [J].
ROSENFELD, A .
INFORMATION AND CONTROL, 1981, 50 (02) :119-127
[7]  
Rosenfeld A., 1979, PICTURE LANGUAGES
[8]   BOUNDARY DETECTION IN MULTIDIMENSIONS [J].
UDUPA, JK ;
SRIHARI, SN ;
HERMAN, GT .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1982, 4 (01) :41-50