A PARALLEL THINNING ALGORITHM FOR MEDIAL SURFACES

被引：67
作者：
BERTRAND, G
机构：
[1] LABO IAAI, ESIEE, Cité Descartes, 93162 Noisy-le-Grand Cedex
来源：
PATTERN RECOGNITION LETTERS | 1995年 / 16卷 / 09期
关键词：
THINNING ALGORITHMS; SKELETON; 3-DIMENSIONS; CUBIC GRIDS; DISCRETE TOPOLOGY;
D O I：
10.1016/0167-8655(95)00034-E
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new 3D parallel thinning algorithm for medial surfaces is proposed. It works in cubic grids with the 6-connectivity. This algorithm is based on a precise definition of end points which are points belonging to surfaces or curves. We give a necessary and sufficient Boolean condition for characterizing points which are simple, non-ends and which are border points of a certain type (N, S, E, W, U, D). The algorithm consists precisely in removing all points satisfying the condition: it has a little computational cost and it is based on a clear thinning criterion.
引用
收藏
页码：979 / 986
页数：8
相关论文
共 16 条
[1]  
Bertrand G., 1994, 4th DGCI. Discrete Geometry for Computer Imagery, P137
[2]  
BERTRAND G, 1994, 3 P SPIE C VIS GEOM, V2356, P113
[3]  
BERTRAND G, 1995, UNPUB PATTERN RECOGN
[4]  
BERTRAND G, 1994, PATTERN RECOGN, V145, P169
[5]  
BERTRAND G, 1992, CHARACTERIZATIONS 3
[6]  
BERTRAND G, 1992, 2ND EUR C COMP VIS, P710
[7]  
GONG WX, 1990, 10TH P INT C PATT RE, P188
[8]  
HALL RW, 1992, 1 P SPIE C VIS GEOM, V1832, P172
[9]   A DIGITAL FUNDAMENTAL GROUP [J].
KONG, TY .
COMPUTERS & GRAPHICS, 1989, 13 (02) :159-166
[10]   DIGITAL-TOPOLOGY - INTRODUCTION AND SURVEY [J].
KONG, TY ;
ROSENFELD, A .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1989, 48 (03) :357-393
12