Abstract
Efim Khalimsky’s digital Jordan curve theorem states that the complement of a Jordan curve in the digital plane equipped with the Khalimsky topology has exactly two connectivity components. We present a new, short proof of this theorem using induction on the Euclidean length of the curve. We also prove that the theorem holds with another topology on the digital plane but then only for a restricted class of Jordan curves.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aleksandrov, P. S. 1937, Diskrete Räume. Mat. Sb. 2 (44), 501–519.
Bourbaki, Nicolas 1961, Topologie générale. Éléments de mathématique, première partie, livre III, chapitres 1 & 2. Third edition. Paris: Hermann.
Halimskiı, E. D. 1970, Applications of connected ordered topological spaces in topology. Conference of Math. Departments of Povolsia.
Khalimsky, Efim; Kopperman, Ralph; Meyer, Paul R. 1990, Computer graphics and connected topologies on finite ordered sets. Topology Appl. 36, 1–17.
Kong, Yung; Kopperman, Ralph; Meyer, Paul R. 1991, A topological approach to digital topology. Amer. Math. Monthly 98, 901–917.
Rosenfeld, Azriel 1979, Digital topology. Amer. Math. Monthly 86, 621–630.
Wyse, Frank, et al. 1970, Solution to problem 5712. Amer. Math. Monthly 77, 1119.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiselman, C.O. (2000). Digital Jordan Curve Theorems. In: Borgefors, G., Nyström, I., di Baja, G.S. (eds) Discrete Geometry for Computer Imagery. DGCI 2000. Lecture Notes in Computer Science, vol 1953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44438-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-44438-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41396-7
Online ISBN: 978-3-540-44438-1
eBook Packages: Springer Book Archive