【摘要】 本文给出了三维数字曲面边界点的定义及一般曲面的定义,并提出了一个连通块划分的递归算法,此算法的时间复杂性为 O（nlog₂n）,这里 n 为三维空间中点的数目,这优于Roseftfeld 等人提出的复杂性为 O（n²）的连通块划分算法。我们已在 Dual-68000机器上用该算法实现了一个三维数字曲面识别的系统。更多还原

【Abstract】 This paper has given the definions of three dimensional digital surface and surface border point,It also has given a recurrent algorithm of division of connected components Time Complexity of the algorithm is O（nlog₂n）, here"n"is the number of point in three dimensional space.It is better than the algorithm of division of connected components proposed by Rosenfeld Based on this,We have realized a system of recognition of three dimensional digital surfaces更多还原