PDFAbstract: In the digital plane Z2, we define connectedness induced by a set of walks of the same lengths in the 8-adjacency graph. The connectedness is shown to satisfy a digital analogue of the Jordan curve theorem. This proves that the 8-adjacency graph with a set of walks of the same lengths provides a convenient structure on the digital plane Z2 for the study of digital images.
Keywords: Digital plane, 8-adjacency graph, walk, connectedness, Jordan curve theorem
Cite this paper
Josef Slapal. (2017) Structuring Digital Plane by the 8-Adjacency Graph with a Set of Walks. International Journal of Mathematical and Computational Methods, 2 , 150-154
Copyright © 2017 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution License 4.0