×

Path-induced closure operators on graphs for defining digital Jordan surfaces. (English) Zbl 1513.54128

Summary: Given a simple graph with the vertex set \(X\), we discuss a closure operator on \(X\) induced by a set of paths with identical lengths in the graph. We introduce a certain set of paths of the same length in the 2-adjacency graph on the digital line \(\mathbb{Z}\) and consider the closure operators on \(\mathbb{Z}^m (m\) a positive integer) that are induced by a special product of \(m\) copies of the introduced set of paths. We focus on the case \(m = 3\) and show that the closure operator considered provides the digital space \(\mathbb{Z}^3\) with a connectedness that may be used for defining digital surfaces satisfying a Jordan surface theorem.

MSC:

54H30 Applications of general topology to computer science (e.g., digital topology, image processing)
54A05 Topological spaces and generalizations (closure spaces, etc.)
54D05 Connected and locally connected spaces (general aspects)
52C99 Discrete geometry
68R10 Graph theory (including graph drawing) in computer science

References:

[1] Klette R., Rosenfeld A., Digital Geometry - Geometric Methods for Digital Picture Analysis, Elsevier, Singapore, 2006.
[2] Kong T.Y., Rosenfeld A., Digital topology: Introduction and survey, Comput. Vision Graphics Image Process., 1989, 48, 357-393.
[3] Rosenfeld A., Picture Languages, Academic Press, New York, 1979. · Zbl 0471.68074
[4] Khalimsky E.D., Kopperman R., Meyer P.R., Computer graphics and connected topologies on finite ordered sets, Topology Appl., 1990, 36, 1-17. · Zbl 0709.54017
[5] Khalimsky E.D., Kopperman R., Meyer P.R., Boundaries in digital plane, J. Appl. Math. Stochast. Anal., 1990, 3, 27-55. · Zbl 0695.54017
[6] Kiselman Ch.O., Digital Jordan curve theorems, In: G. Borgefors at al. (Eds.), Discrete Geometry for Computer Imagery, Lect. Notes Comput. Sci. 1953, Springer, Berlin-Heidelberg, 2000, 46-56. · Zbl 1043.68804
[7] Kong T.Y, Kopperman R., Meyer P.R., A topological approach to digital topology, Amer. Math. Monthly, 1991, 98, 902-917. · Zbl 0761.54036
[8] ŠSlapal J., Jordan curve theorems with respect to certain pretopologies on ℤ^2, In: S. Brlek at al. (Eds.), Discrete Geometry for Computer Imagery, Lect. Notes Comput. Sci. 5810, Springer, Berlin-Heidelberg, 2009, 252-262. · Zbl 1261.68118
[9] Brimkov V.E., Klette R., Border and surface tracing - theoretical foundations, IEEE Trans. Patt. Anal. Machine Intell., 2008, 30, 577-590.
[10] Kong T.Y., Roscoe W., Continuous analogs of axiomatized digital surfaces, Comput. Vision Graphics Image Process., 1985, 29, 60-86. · Zbl 0625.68088
[11] Morgenthaler D.G., Rosenfeld A., Surfaces in three dimensional digital images, Information and Control, 1981, 28, 227-247. · Zbl 0502.68017
[12] Reed M., Rosenfeld A., Recognition of surfaces in three dimensional digital images, Information and Control, 1982, 53, 108-120. · Zbl 0509.68095
[13] Kopperman R., Meyer P.R., Wilson R.G., A Jordan surface theorem for three-dimensional digital spaces, Discrete Comput. Geom., 1991, 6, 155-161. · Zbl 0738.68086
[14] Melin E., Digital surfaces and boundaries in Khalimsky spaces, J. Math. Imaging and Vision, 2007, 28, 169-177. · Zbl 1523.68133
[15] Šlapal J., Graphs with a path partition for structuring digital spaces, Inform. Sciences, 2013, 233, 305-312. · Zbl 1284.05310
[16] Šlapal J., Closure operators on graphs for modeling connectedness in digital spaces, Filomat, 2018, 32, 5011-5032. · Zbl 1499.54220
[17] Šlapal J., Galois connections between sets of paths and closure operators in simple graphs, Open Math., 2018, 16, 1573-1581. · Zbl 1407.05070
[18] Harrary F., Graph Theory, Addison-Wesley Publ. Comp., Reading, Massachussets, Menlo Park, California, London, Don Mills, Ontario, 1969. · Zbl 0182.57702
[19] Sabidussi G., Graph multiplication, Math. Z., 1960, 72, 446-457. · Zbl 0093.37603
[20] Engelking R., General Topology, Państwowe Wydawnictwo Naukowe, Warszawa, 1977.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.