Finitary 1-Simply Connected Digital Spaces

Abstract Finitary 1-simply connected digital spaces are discrete analogs of the important simply connected spaces in classical topology (i.e., connected spaces in which every loop can be continuously pulled to a point without leaving the space). Loosely speaking, 1-simply connected digital spaces are graphs in which there are no holes larger than a triangle. Many spaces previously studied in digital topology and geometry are instances of this concept. Boundaries in pictures defined over finitary 1-simply connected digital spaces have some desirable general properties; for example, they partition the space into a connected interior and a connected exterior. There is a “one-size-fits-all” algorithm which, given a picture over a finitary 1-simply connected digital space and a boundary face, will return the set of all faces in that boundary, provided only that this set is finite; the proof of correctness of this algorithm is an immediate consequence of the general properties of such spaces.

[1]  Kendall Preston,et al.  Multidimensional Logical Transforms , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Vladimir A Kovalevsky.  Discrete topology and contour definition , 1984, Pattern Recognit. Lett..

[3]  Jayaram K. Udupa,et al.  A justification of a fast surface tracking algorithm , 1992, CVGIP Graph. Model. Image Process..

[4]  T. Yung Kong,et al.  A topological approach to digital topology , 1991 .

[5]  M. Farber.  Bridged graphs and geodesic convexity , 1987, Discret. Math..

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

[7]  Vladimir A. Kovalevsky,et al.  Finite topology as applied to image analysis , 1989, Comput. Vis. Graph. Image Process..

[8]  Jayaram K. Udupa,et al.  Surface Shading in the Cuberille Environment , 1985, IEEE Computer Graphics and Applications.

[9]  A. W. Roscoe,et al.  Concepts of digital topology , 1992 .

[10]  Gabor T. Herman,et al.  Boundaries in digital spaces: Basic theory , 1996 .

[11]  S. Hughes,et al.  Application of a new discreet form of Gauss' theorem for measuring volume. , 1996, Physics in medicine and biology.

[12]  Samuel Matej,et al.  Efficient 3D grids for image reconstruction using spherically-symmetric volume elements , 1995 .

[13]  Martin Loebl,et al.  Jordan Graphs , 1996, CVGIP Graph. Model. Image Process..

[14]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm , 1980, SIGGRAPH '80.

[15]  Gabor T. Herman,et al.  On topology as applied to image analysis , 1990, Comput. Vis. Graph. Image Process..

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

[17]  Supun Samarasekera,et al.  Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation , 1996, CVGIP Graph. Model. Image Process..

[18]  David Middleton,et al.  Sampling and Reconstruction of Wave-Number-Limited Functions in N-Dimensional Euclidean Spaces , 1962, Inf. Control..

[19]  Ralph Kopperman,et al.  The Khalimsky Line as a Foundation for Digital Topology , 1994 .

[20]  Azriel Rosenfeld,et al.  Fuzzy Digital Topology , 1979, Inf. Control..

[21]  Gabor T. Herman,et al.  Oriented Surfaces in Digital Spaces , 1993, CVGIP Graph. Model. Image Process..

[22]  Gabor T. Herman,et al.  A topological proof of a surface tracking algorithm , 1982, Comput. Vis. Graph. Image Process..

[23]  Jayaram K. Udupa,et al.  Fast surface tracking in three-dimensional binary images , 1989, Comput. Vis. Graph. Image Process..

[24]  Christian Roux,et al.  Determination of discrete sampling grids with optimal topological and spectral properties , 1996, DGCI.

[25]  Ralph Kopperman,et al.  A Jordan surface theorem for three-dimensional digital spaces , 1991, Discret. Comput. Geom..

[26]  C. Kittel.  Introduction to solid state physics , 1954 .