Abstract
Connectivity has been defined in the framework of topological spaces, but also in graphs; the two types of definitions do not always coincide. Serra gave a set of formal axioms for connectivity, which consists in a list of properties of the family of all connected subsets of a space; this definition includes as particular case connected sets in a topological space or in a graph. He gave an equivalent characterization of connectivity in terms of the properties of the operator associating to a subset and a point of that space, the connected component of that subset containing that point. In this paper we give another family of axioms, equivalent to those of Serra, where connectivity is characterized in terms of separating pairs of sets. In the case of graphs, where connected sets are generated by pairs of end-vertices of edges, this new set of axioms is equivalent to the separation axioms given by Haralick.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Alexandroff, “Diskrete Raüme,” Mat. Sb.,Vol. 2, pp. 501–518, 1937.
P. Alexandroff and H. Hopf, Topologie, Erster Band, Springer-Verlag: Berlin, 1935.
A. Baddeley and H. Heijmans,“Incidence and lattice calculus with applications to stochastic geometry and image analysis,” Applicable Algebra in Engineering, Communication Computing, Vol. 6, pp. 129–146, 1995.
G. Birkhoff, Lattice Theory(3rd edition), American Mathematical Society Colloquium Publications: Providence, RI, 1984, Vol. 25.
J.M. Chassery, “Connectivity and consecutivity in digital pictures,” Computer Graphics Image Processing, Vol.9, pp. 294–300, 1979.
C.J. Everett, “Closure operators and Galois theory in lattices,” Transactions of the American Mathematical Society, Vol. 55, pp. 514–525, 1944.
R.M. Haralick and L.G. Shapiro, Computer and Robot Vision, Addison-Wesley, 1992, Vol. 1, pp. 191–198.
T.Y. Kong, R. Kopperman, and P.R. Meyer, “Guest editors' preface to special issue on digital topology,” Topology and its Applications, Vol. 46, pp. 173–179, 1992.
V.A. Kovalevsky, “Finite topology as applied to image analysis,” Computer Vision, Graphics and Image Processing, Vol. 46, pp. 141–161, 1989.
H. Lord, “Connectedness and disconnectedness,” Papers on General Topology and Applications, Annals of the New York Acad. of Sci., Vol. 767, pp. 115–139, 1995.
D. Nogly and M. Schladt, “Digital topology on graphs,” Computer Vision and Image Understanding, Vol. 63, pp. 394–396, 1996.
O. Ore, “Galois connexions,” Transactions of the American Mathematical Society, Vol. 55, pp. 493–513, 1944.
G. Preuß, “Semiuniform convergence spaces,” Mathematica Japonica, Vol. 41, 465–491, 1995.
C. Ronse, “Openings: Main properties, and how to construct them,” in Mathematical Morphology: Theory and Hardware, R.M. Haralick (Ed.), Oxford Series on Optical and Imaging Sciences, Vol. 10, Oxford University Press: Oxford, 1997 (to appear).
J. Serra, Image Analysis and Mathematical Morphology, Academic Press: London, 1982.
J. Serra, Mathematical morphology for Boolean lattices, in Image Analysis and Mathematical Morphology, Theoretical Advances, J. Serra (Ed.), Academic Press: London, 1988, Vol. 2, pp. 37–58.
M.B. Smyth, “Semi-metrics, closure spaces, and digital topology,” Theoretical Computer Science, Vol. 151, pp. 257–276, 1995.
“A special topology for the integers. Solution to problem 5712,” American Math. Monthly, Vol. 77, p. 1119, 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ronse, C. Set-Theoretical Algebraic Approaches to Connectivity in Continuous or Digital Spaces. Journal of Mathematical Imaging and Vision 8, 41–58 (1998). https://doi.org/10.1023/A:1008210216583
Issue Date:
DOI: https://doi.org/10.1023/A:1008210216583