Simple points, topological numbers and geodesic neighborhoods in cubic grids

Abstract We introduce the notion of geodesic neighborhood in order to define some topological numbers associated with a point in a three-dimensional cubic grid. For {6, 26} and {6, 18} connectivities, these numbers lead to a characterization of simple points which consists in only two local conditions.

[1]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

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

[3]  D. Morgenthaler.  Three-Dimensional Digital Topology: The Genus. , 1980 .

[4]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[5]  Gilles Bertrand,et al.  A New Topological Classification of Points in 3D Images , 1992, ECCV.

[6]  Gilles Bertrand,et al.  A new characterization of three-dimensional simple points , 1994, Pattern Recognition Letters.

[7]  Grégoire Malandain,et al.  Fast characterization of 3D simple points , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[8]  Azriel Rosenfeld,et al.  Three-Dimensional Digital Topology , 1981, Inf. Control..

[9]  Nicholas Ayache,et al.  Topological segmentation of discrete surfaces , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[11]  Gilles Bertrand,et al.  A Boolean characterization of three-dimensional simple points , 1996, Pattern Recognition Letters.

[12]  Dana H. Ballard,et al.  Computer Vision , 1982 .