Structuring Digital Plane by the 8-Adjacency Graph with a Set of Walks

AUTHOR(S):

TITLE

Structuring Digital Plane by the 8-Adjacency Graph with a Set of Walks

ABSTRACT

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

REFERENCES

[1] F. Harrary, Graph Theory, Addison-Wesley Publ. Comp., Reading, Massachussets–Menlo Park, California–London–Don Mills, Ontario 1969.

[2] E.D. Khalimsky, R. Kopperman and P.R. Meyer, Computer graphics and connected topologies on finite ordered sets, Topology Appl. 36, 1990, pp. 1–17.

[3] E.D. Khalimsky, R. Kopperman and P.R. Meyer, Boundaries in digital plane, J. Appl. Math. Stoch. Anal. 3, 1990, pp. 27–55.

[4] T.Y. Kong and W. Roscoe, A theory of binary digital pictures, Comput. Vision Graphics Image Process. 32, 221–243 (1985).

[5] T.Y. Kong and A. Rosenfeld, Digital topology: Introduction and survey, Comput. Vision Graphics Image Process. 48, 1989, pp. 357–393.

[6] E. Melin, Digital surfaces and boundaries in Khalimsky spaces, J. Math. Imaging Vis. 28, 2007, pp. 169–177.

[7] A. Rosenfeld, Connectivity in digital pictures, J. Assoc. Comput. Mach. 17, 1970, pp. 146–160.

[8] A. Rosenfeld, Digital topology, Amer. Math. Monthly 86, 1979, pp. 621–630.

[9] J. ˇ Slapal, Jordan cutve theorems with respect to certain pretopologies on Z2, Lect. Notes Comput. Sci. 5810, 2009, pp. 252-262.

[10] J. ˇ Slapal, Graphs with a path partition for structuring digital spaces, Inf. Sciences 233, 2013, pp. 305–312.

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