论文信息 - A 3D-hole closing algorithm

A 3D-hole closing algorithm

Contrary to the 2D case, a 3D hole is not a subset of the 3D space. It is therefore not possible to use connected component search algorithms for detecting and suppressing 3D holes.

[1] Gilles Bertrand,et al. Simple points, topological numbers and geodesic neighborhoods in cubic grids , 1994, Pattern Recognit. Lett..

[2] Grégoire Malandain,et al. Topologically correct skeleton in n-D , 1995 .

[3] G. Borgefors. Distance transformations in arbitrary dimensions , 1984 .

[4] Azriel Rosenfeld,et al. Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[5] T. Yung Kong,et al. A digital fundamental group , 1989, Comput. Graph..