Intersection Number of Paths Lying on a Digital Surface and a New Jordan Theorem

The purpose of this paper is to define the notion of "real" intersection between paths drawn on the 3d digital boundary of a connected object. We consider two kinds of paths for different adjacencies, and define the algebraic number of oriented intersections between these two paths. We show that this intersection number is invariant under any homotopic transformation we apply on the two paths. Already, this intersection number allows us to prove a Jordan curve theorem for some surfels curves which lie on a digital surface, and appears as a good tool for proving theorems in digital topology about surfaces.

[1]  Alexandre Lenoir,et al.  Fast Estimation of Mean Curvature on the Surface of a 3D Discrete Object , 1997, DGCI.

[2]  Jayaram K. Udupa Multidimensional Digital Boundaries , 1994, CVGIP Graph. Model. Image Process..

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

[4]  Alexandre Lenoir,et al.  Topology Preservation Within Digital Surfaces , 2000, Graph. Model..

[5]  Ramakant Nevatia,et al.  Recognizing 3-D Objects Using Surface Descriptions , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Azriel Rosenfeld,et al.  Digital surfaces , 1991, CVGIP Graph. Model. Image Process..

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