A Jordan Curve Theorem for 2-dimensional Tilings
Abstract.
The classical Jordan curve theorem for digital curves asserts that the Jordan curve theorem remains valid in the Khalimsky plane. Since the Khalimsky plane is a quotient space of induced by a tiling of squares, it is natural to ask for which other tilings of the plane it is possible to obtain a similar result. In this paper we prove a Jordan curve theorem which is valid for every locally finite tiling of . As a corollary of our result, we generalize some classical Jordan curve theorems for grids of points, including Rosenfeld’s theorem.
Key words and phrases:
Digital plane, Tiling, Alexandrov Topologies, Jordan Curve, simple closed curve, cycle in a graph2020 Mathematics Subject Classification:
Primary: 54H30, 54H99, 54D05, 52C20; Secondary: 05C10, 05C40, 68U05, 54B15, 54D101. Introduction
The Jordan curve theorem asserts that a simple closed curve divides the plane into two connected components, one of these components is bounded whereas the other one is not. This theorem was proved by Camille Jordan in 1887 in his book Cours d’analyse [7].
During the decade of the seventies, Azriel Rosenfeld published a series of articles [19, 20, 21, 22, 23, 24] wherein he studies connectedness properties of the grid of points with integer coordinates . For any point Rosenfeld defines its 4-neighbors as the four points and , whilst the four points as well as the 4-neighbors are its 8-neighbors. For or , a k-path is a finite sequence of points in such that for every , is a -neighbor of . A subset of is k-connected if there is a -path between any two elements of . A k-component of is a maximal -connected subset. Lastly, a simple closed k-path is a -connected set which contains exactly two -neighbors for each of its points. In this case we can describe as a -path , where is a -neighbor of iff (modulo ). In [20], Rosenfeld proves the following discrete Jordan curve theorem.
Theorem 1.1.
Let be a simple closed -path with at least five points. Then has exactly two -components.

In the same decade, Efim Khalimsky developed a different approach for studying topological properties of the sets and [8, 9], endowing them with topologies that captured the proximity of its elements. These sets, together with the topologies proposed by Khalimsky, are known as the digital line (or Khalimsky line) and the digital plane (or Khalimsky plane), respectively. Khalimsky also proved a Jordan curve theorem for the digital plane (see [8, 9]). We explain this theorem later, in Section 2 ( Theorem 2.6).
There are other versions of Jordan curve theorems for grids of points that are not the usual squared grid. For example, the case where the points are configured in a hexagonal grid has been studied in [15, Theorem 26] and [14]. In [17], V. Neumann-Lara and R. Wilson presented an analogue to the Jordan curve theorem in the context of graph theory (see Theorem 4.3). This result will be a key tool for the proof of our main theorem.
One way to define the topology of the digital plane is by an equivalence relation in resulting of identifying the points in the same edge or the same face of a tiling of the plane by squares of the same size (see equation 2.1 in Section 2). This approach for describing the topology of the digital plane leads us to question if it is possible to generalize Khalimsky’s Jordan curve theorem for every quotient space of obtained by doing a similar identification in any nice enough tiling. Our main result, Theorem 4.4, states that this generalization is possible if the tiling is locally finite.
Our paper is organized as follows. In Section 2 we recall all basic notions concerning Alexandrov spaces and tilings. In Section 3, we introduce what the digital version of a tiling is and we prove some basic properties of these topological spaces. In Section 4, we introduce the definition of a digital Jordan curve and we prove our version of the Jordan curve theorem for tilings (Theorem 4.4). To finish the paper, in Section 5 we explore some basic properties of closed and open digital Jordan curves, that will be used in Section 6 to obtain conditions in order to guarantee that a digital Jordan curve encloses a face of the tiling.
2. Preliminaries
2.1. Alexandrov Topologies
Let be a topological space. The topology is called an Alexandrov topology if the intersection of an arbitrary family of open sets is open. In this case we say that is an Alexandrov discrete space.
It is not difficult to see that is an Alexandrov discrete space iff each point has a smallest neighborhood, which we denote by . Clearly, is the intersection of all open neighborhoods of and therefore is open. Also, every subspace of an Alexandrov space is an Alexandrov space.
The first important example of an Alexandrov space concerning the contents of this work is the digital line, also known as the Khalimsky line.
Example 2.1.
For every , let
Then the set of integers , together with the topology given by the base is known as the digital line.
Another important example is the digital plane, also known as the Khalimsky plane.
Example 2.2.
The Khalimsky plane (or digital plane) is the product space of the Khalimsky line . This product topology coincides with the quotient topology generated by the surjection defined by:
(2.1) |
It is worth highlighting that the quotient map induces an equivalence relation that identifies the interior, the edges (without vertices) and the vertices of the rectangles in the plane. Thus, another way to understand the topology of the digital plane is to think of this space as the set of equivalence classes of this equivalence relation together with the quotient topology induced by . This description of the digital plane is depicted in Figure 2 . As we already mentioned, the digital plane is an Alexandrov space which can be readily verified by noting that

An important tool to understand the connectedness of an Alexandrov space is its connectedness graph.
Definition 2.3.
Let be a topological space. The connectedness graph of is the graph where and if and only if is connected.
Let be a topological space. For every the adjacency set of is the set
Observe that if and only if . In this case we say that and are adjacent.
Given two points , we define a digital path from to as a finite sequence of elements of , , such that , and for every , and are adjacent. We say that is digitally pathwise connected if for every , there is a digital path from to . Lastly, a digital path is a digital arc if or if there is a homeomorphism from a finite interval of the digital line into . We say that is digitally arcwise connected if for every , there is a digital arc from to .
From the definition of the connectedness graph and the definition of a digital path it is clear that is a digital path in if and only if is a path in the connectedness graph of . The following remark specifies the type of subgraphs in the connectedness graph of corresponding to digital arcs. For a proof of the non-trivial implication, see e.g. [16, Theorem 5.6].
Remark 2.4.
Let be a topological space. Then is a digital arc if and only if is an induced simple path in the connectedness graph of .
The following theorem summarizes important results about connectedness in Alexandrov discrete spaces. Its proof can be found in [11, Theorem 3.2] and [15, Lemma 20].
Theorem 2.5.
Let be an Alexandrov discrete space.
-
(1)
For every ,
-
(2)
The following are equivalent:
-
\rma)
X is connected.
-
\rma)
X is digitally pathwise connected.
-
\rma)
X is digitally arcwise connected.
-
\rma)
The connectedness graph of is connected.
-
\rma)
-
(3)
The connected components of are open and closed.
Finally, we enunciate Khalimsky’s Jordan curve theorem for the digital plane. First, we say that a subset of the digital plane is a Jordan curve in the digital plane if for every the complement is a digital arc, and . For a detailed exposition of this theorem, see [11].
Theorem 2.6.
Let be a Jordan curve in the digital plane. Then has exactly two connected components.
2.2. Tilings
To finish this section, let us recall some basic notions about tilings.
Definition 2.7.
Let be a countable family of closed, connected subsets of . We say that is a tiling of if:
-
(a)
,
-
(b)
if , then .
In this case every element is called a tile.
Given a tiling of , the points in the plane that are elements of three or more tiles are called vertices. If , , satisfy that
then each connected component of the set is called an edge. Lastly, the interior of a tile is called a face. If a vertex, an edge or a face are subsets of a tile , we say that it is a vertex, edge or face of the tile, respectively.
As we mentioned in the introduction, for the purposes of this work, we limit our attention to a particular class of tilings, namely tilings that, besides (a) and (b) of the preceding definition, satisfy the following conditions:
-
(c)
is a locally finite collection (namely, each point of the plane has a neighborhood that only intersects a finite number of elements of ),
-
(d)
for each , is homeomorphic to the closed unit disk,
-
(e)
each edge of the tiling is homeomorphic to the interval ,
-
(f)
if two different tiles intersect each other, then their intersection is the disjoint union of a finite set of vertices and edges.
Consequently, from this point onwards, when we talk about tilings, we will refer to tilings that satisfy these requirements.
Example 2.8.
The family is a tiling of the plane.
In the following proposition we encapsulate basic properties of tilings that can be easily proved from the definition.
Proposition 2.9.
Let be a tiling.
-
(1)
If and are two tiles such that , then .
-
(2)
Every tile only intersects a finite number of tiles.
-
(3)
Every tile has at least two vertices.
-
(4)
Every tile has the same number of vertices and edges. Moreover, the boundary of a tile is the disjoint union of alternating vertices and edges, and the boundary of every edge is the set of two vertices that surround it.
From Proposition 2.9-(4), we infer that each edge is determined by two vertices. From its definition, it is clear that each edge is also determined by exactly two faces. Similarly, each face is determined by its boundary, that is, by the vertices and edges of the tile to whom it serves as interior. Also, a vertex is determined both by the faces of the tiles that intersect in it and by the edges that converge in it. In this way we can talk about the faces and edges of a vertex, the vertices and edges of a face, and the faces and vertices of an edge. We denote the sets of faces, edges and vertices of a tiling by , and , respectively. Lastly, if is a vertex, we denote the sets of edges and faces of by and , respectively. We can establish analogous notation for the vertices and edges of a face and for the faces and vertices of an edge.
3. Digital Topology of a Tiling
Let be a tiling of . Consider the set set and the surjection given by
(3.1) |
Namely, identifies the points in the same vertex, edge or face.
Definition 3.1.
The set equipped with the quotient topology induced by is called the digital version of .
Let be a tiling of . Clearly we have that the closure (in ) of any vertex of the tiling is the vertex itself. The closure of an edge is the union of the edge and its two vertices. And, the closure of a face is the union of the the face and all its vertices and edges. This allow us to describe the closure of any element in as follows:
(3.2) |
In the following theorem we prove that is an Alexandrov space, by describing the smallest neighborhood of every element of .
Theorem 3.2.
Let be a tiling. Then is an Alexandrov space. Moreover, for every element the smallest neigborhood of is given by
Proof.
Let be a tiling, the quotient map associated to and an arbitrary element.
If and is an open neighborhoof of , then is an open, saturated neighborhood of . Since is a vertex, it is contained in the closure of its edges and faces, therefore intersects each element of . Moreover, since is a saturated neighborhood then contains all of the faces and edges of , that is, . Next we see that is an open set. Let . If is an element of a face of , then that face is an open set contained in . If is an element of an edge , then there are two tiles that have as a common vertex and such that . Furthermore, for any other tile , the point does not belong to . Since is a locally finite collection of closed sets, its union is a closed subset of ([5, Theorem 1.1.11.]), thus
is an open neighborhood of contained in . Finally, if we consider the set of tiles that contain , and we recall that is a finite set. By the previous argument is an open neighborhood of that is contained in . This proves that is an open set such that
Since was an arbitrary open neighborhood of in we conclude that is the smallest neighborhood of in .
If and is an open neighborhood of , then is an open, saturated neighborhood of . Since is an edge we know that it is contained in the closure of its faces, so intersects the two elements of . Moreover, since is a saturated neighborhood then contains . Thus, . In the same vein as the previous case, we can see that is open in . Since is an arbitrary open neighborhood of in , we have that is the smallest neighborhood of in .
In order to complete the proof, we see that if , then is open in since is the interior of a tile in . ∎
We infer from theorems 2.5 and 3.2, in combination with equality 3.2, that the adjacency set of any element is given by
This information allows us to describe the connectedness graph of any digital version of a tiling. In Figure 3 we illustrate a portion of the tiling of the plane with regular hexagons of the same size as well as the connectedness graph of its digital version. In this graph we depict with white points the vertices of the graph corresponding to the faces of the tiling, with black points the vertices of the graph corresponding to vertices of the tiling, and with black rectangles the vertices of the graph corresponding to the edges of the tiling.

In Figure 4 we present another example, illustrating a portion of a tiling of the plane with squares and hexagons, and the connectedness graph of its digital version. The vertices of the graph correspond to the elements of the digital version in the same way as in Figure 3.

For the subsequent material, we recall the definition of a planar graph:
Definition 3.3.
Let be a graph. We say that is a planar graph if there is a function such that:
-
(1)
The image of each element of is a singleton.
-
(2)
The image of each element of is a subset of homeomorphic to .
-
(3)
For any two elements , ,
-
(4)
If and are the vertices of the edge , then
In this situation, we say that is a planar embedding of . Sometimes the set is also called a geometric realization of .
Lemma 3.4.
Let be a tiling. The connectedness graph of , with the subspace topology induced by , is a planar graph.
Proof.
Let be the connectedness graph of . The set of vertices of is precisely the set . We know that the edges of always denote the adjacency between an edge of the tiling and its two vertices. Therefore, every edge in is a pair of the form , where and . For every , pick a point . If is a vertex of , we define as the connected component of delimited by and . It is clear that . Since is an edge of the tiling, then is homeomorphic to the interval and
Moreover, if then , considering that any two different edges of the tiling have an empty intersection. Therefore the function given by
proves the planarity of . ∎
Proposition 3.5.
Let be a tiling. The connectedness graph of is a planar graph.
Proof.
Let be the connectedness graph of and the connectedness graph of . Then is a subgraph of and by Lemma 3.4 there is a bijection from the set of vertices and edges of to a planar embedding of . In order to prove the planarity of , we want to extend the definition of to a function satisfying conditions (1)-(4) of Definition 3.3. For that purpose, it suffices to define for every element of and for every edge of connecting a face of the tiling with one of its vertices or edges.
Let , we know that there is a unique tile that has as a face, and we know that . Let be a homeomorphism between , the unit closed disk of , and . Consider the set , which is contained in since is a homeomorphism and . Without lost of generality we can suppose that are numbered clockwise. Then we can number the set denoting by the arc delimited by and and then proceeding in a clockwise manner. For every , define , considering that is a homeomorphism we can assure that . Being consistent with the notation introduced in Lemma 3.4, we have a point such that . Let , which is an element of .
For every , let Now we consider the family
whose elements are pairwise disjoint and they are contained in .
Let . Since , it follows that . Each element of the family is an arc delimited by and one of the points in the set , where . Thus we can denote each arc as , where is the point in that, alongside , delimits . From its definition, it is clear that . These arcs are pairwise disjoint, since is a homeomorphism and the elements of are pairwise disjoint. Also, each arc is contained in , since the elements of are contained in . From here we can infer that if is another face of the tiling, then the elements of and are pairwise disjoint. Furthermore, we can also conclude that the elements of do not intersect . Lastly, note that implies
Therefore the function given by
proves the planarity of . ∎
4. A Jordan Curve Theorem for Tilings
In this section we present our generalization of Khalimsky’s Jordan curve theorem. To achieve this we rely on the connectedness graph of the digital version of a tiling.
First we generalize the definition of a digital Jordan curve that we have previously introduced in Section 2.
Definition 4.1.
Let be a tiling. A subset of is a digital Jordan curve if and if for every , is a digital arc.
Recall that is a digital arc in if and only if is an induced simple path in the connectedness graph of (Remark 2.4). This correspondence allows us to define a Jordan curve in the context of graph theory.
Definition 4.2.
Let be a graph. A graph-theoretical Jordan curve is an induced cycle of length equal or greater than four.
Let be a graph and a vertex of . Keeping in mind the correspondence between a topological space and its connectedness graph, we denote by the subgraph induced by the vertices of adjacent to . We say that is locally Hamiltonian if for every vertex of , has a Hamiltonian cycle. The following theorem is crucial for our generalization and it is due to V. Neumann-Lara and R. Wilson ([17]).
Theorem 4.3.
If is a locally Hamiltonian, connected graph and is a graph-theoretical Jordan curve, then
-
\rma)
the complement of has at most two connected components in ,
-
\rma)
if is planar, then the complement of has exactly two connected components in .
It can be seen from Neumann-Lara and Wilson’s proof that if is an infinite, planar, locally Hamiltonian and connected graph and is a graph-theoretical Jordan curve, then out of the two connected components that make up the complement of in , one is bounded whereas the other one is not. We call the set of vertices of the bounded component the interior of , and denote it by . In a similar manner, the set of vertices of the unbounded component, , are the exterior of .
Theorem 4.4.
Let be a tiling and a digital Jordan curve. Then has exactly two connected components.
Proof.
Let be the connectedness graph of , it suffices to see that satisfies the hypotheses of Theorem 4.3. Let be the quotient function associated to the topology of (see equation 3.1). We know that is continuous and therefore the connectedness of is guaranteed by the connectedness of . Moreover, we know that is an Alexandrov discrete space, so by Theorem 2.5 we have that is connected. In addition, is a planar graph by Proposition 3.5.
It only rests us to prove that is a locally Hamiltonian graph. By Theorem 3.2, if is a vertex of we have that:
If , we know that at least three tiles intersect in . Each of these tiles has exactly two edges whose vertex is . This fact allows us to infer that if we consider the set (which is finite) and we number their elements clockwise, then every two consecutive edges determine a face of (and none of these faces is determined by two different pairs of edges). We also know that every edge of is determined by exactly two faces of . Lastly, we know that in the connectedness graph there are no two adjacent edges nor two adjacent faces. Thus the subgraph induced by is a cycle wherein the vertices of the graph corresponding to edges of the tiling and the vertices of the graph corresponding to faces of the tiling alternate.
If , has exactly two vertices and two faces, furthermore, both vertices are vertices of both faces. For that reason the subgraph of induced by is a cycle with exactly four vertices.
Finally, if we recall the analysis made in Proposition 3.5 to conclude that the vertices and edges of alternate in , allowing us to verify that is a cycle.
In any case, we have proved that the subgraph induced by is a cycle and thus is locally Hamiltonian. In addition, we know that since is a digital Jordan curve, then the subgraph induced by in is a graph-theoretical Jordan curve. Hence, by Theorem 4.3 we can conclude that has exactly two connected components in .
To finish the proof, recall that is an Alexandrov space. Since has exactly two connected components in , by Theorem 2.5 we have that has exactly two connected components. Moreover, we know that the connected components of are precisely the vertices of the connected components of ; in other words, the connected components of are its interior , which is bounded, and its exterior , which is not. ∎
5. Open and Closed Digital Jordan Curves
In [10], Khalimsky, Kopperman and Meyer developed a theory on the processing of digital pictures by means of studying boundaries. Their work relies on properties of the digital plane and on Khalimsky’s Jordan curve theorem. The digital plane is not a homogeneous space, nonetheless for any two faces (where is the tiling of Example 2.8) there is a homeomorphism from the digital plane into itself that maps to . For this reason, it is convenient to think about the pixels on a screen as the faces of the tiling.
Motivated by this approach, we are now interested in studying digital Jordan curves that satisfy two conditions:
-
(W1)
half of the elements of are faces of the tiling (and they alternate with the non-faces elements of the curve).
-
(W2)
encloses a face of the tiling (namely, ).
Lemma 5.1.
Let be a tiling and a digital Jordan curve. Then, for every , .
Proof.
Let and let be the connectedness graph of . We proceed by contradiction. Suppose that and let and be the two adjacent points to in . It is clear that and are not adjacent. We know that the subgraph induced by is a cycle with at least four elements. For that reason there are two paths contained in that only intersect at and . Let and be two vertices, different from and , in each of these paths. Since , then, with the exception of and , the vertices of the paths we mentioned earlier are contained in . In particular, .
Since is a tiling, is a planar graph and thus there is a map that attests the planarity of . Let be the subgraph induced by the vertices in . Being a subgraph of , is a planar graph too. Since , we have that , therefore is a vertex of exactly two faces of . Let be the cycle that determines the bounded face of having as a vertex (the other face contains the exterior face of the subgraph induced by the vertices of ). Then we know that is the boundary of a set , homeomorphic to a closed disk, and that .
Now we construct a graph with the set of vertices , where , and the set of edges . We sustain that is a planar graph. Indeed, since is homeomorphic to a closed disk and , we can replicate the construction of the point and the sets in the proof of Proposition 3.5 to prove the existence of a point and sets such that the function defined as
proves the planarity of .
However, if we take a look at the sets of vertices and , we see that contains a subdivision of a complete bipartite graph , which contradicts Kuratowski’s theorem ([3, Theorem 4.4.6]). Therefore we have proved that . ∎
Proposition 5.2.
Let be a tiling and a digital Jordan curve. The following are equivalent:
-
\rma)
is closed.
-
\rma)
and are open.
-
\rma)
is nowhere dense.
-
\rma)
is dense.
-
\rma)
.
-
\rma)
.
Proof.
a)b). is the complement of and thus it is open. In addition, since is an Alexandrov space, Theorem 2.5 guarantees that and are open and closed in , because they are the connected components of . Since the latter is open in , we conclude that and are also open in
b)c). We prove the contrapositive. Suppose there is an element . This implies that . In particular, we have that and hence . Thus . In this situation, can not be a digital Jordan curve since the connectedness graph of contains at least one vertex, one edge and one face adjacent to each other; in other words, the connectedness graph of contains cycles of length . For that reason, is not closed and therefore is not open, which in turn implies that b) is false.
c)d). Suppose that is not dense. Since is the disjoint union of , and , there is a point such that . Therefore , so and thus .
d)e). Assume there is a point . Thus . Since , we have that and therefore cannot be dense.
e)f). First let us prove that is closed. By e), the elements of are alternating vertices and edges. The closure of a vertex is the vertex itself, and the closure of an edge is the union of the edge and its two vertices. Since the vertices and edges alternate in , the vertices of each edge in are contained in . Therefore the closure of each element of is contained in . Since is an Alexandrov discrete space this implies that is closed.
Now by the implication a)b), we infer that and are open. This proves that . Furthermore, since is the disjoint union of , and , we conclude that is a closed set that contains . Thus
It rests us to prove that . Since and are disjoint sets, it is enough to prove that for every . Let , by Lemma 5.1 we have that . If is an edge, then the elements of are and its two faces, and the elements of are the two faces and the two vertices of . We know that and are disjoint, and that the vertices of are contained in . Thus contains at least one of the faces of , implying that . Lastly, if is a vertex, then and therefore . In any case, .
f)a). This follows from the fact that the boundary of any subset of a topological space is always closed. ∎
Analogously, we can obtain a dual version of Proposition 5.2. We let the proof to the reader, since it is similar to the previous one.
Proposition 5.3.
Let be a tiling and a digital Jordan curve. The following are equivalent:
-
(a)
is open.
-
(b)
and are closed.
-
(c)
.
After Proposition 5.3-(c), we conclude that open digital curves are made exclusively of faces and edges (hence, they satisfy condition W1). Furthermore, if is an open digital Jordan curve, then is closed, so for every , , and whether is a vertex, an edge or a face, always contains a vertex of the tiling. This reasoning yields the following remark.
Remark 5.4.
If is an open digital curve, then .
However, we cannot guarantee that contains a face of the tiling. This situation is pictured for the tiling of the plane with regular hexagons in Figure 5. In this figure, the dotted line intersects all the elements of a digital Jordan curve consisting only of edges and faces of the tiling, whilst the thick black line intersects all the elements of its interior, none of which is a face of the tiling.

On the other hand, by Proposition 5.2-(d), every closed digital Jordan curve satisfies condition W2. However, this kind of curves may not be very interesting, since they do not contain any face (and therefore they do not satisfy condition W1). This is why, if we are looking for a class of digital Jordan curves satisfying W1 and W2, we need to add an extra condition. We formalize this in the following section.
6. Well-behaved Digital Jordan Curves
Intuitively, the problem of the example in Figure 5 is that the elements of that are faces of the tiling, are very close to each other. In order to prevent this from happening, we need the following.
Definition 6.1.
Let be a tiling and a digital Jordan curve. We say that is well-behaved if for every and every , .
Clearly the curve of Figure 5 is not well-behaved.
Lemma 6.2.
Let be a tiling and a well-behaved digital Jordan curve. If (in particular, if is a well-behaved open digital jordan curve), then .
Proof.
Since and are the components of , we can find an open set such that . Thus,
Assume that , and pick an element . Notice that
Now, we can use the assumption that to conclude that , which is impossible because is well-behaved. Therefore , as desired. ∎
As an immediate consequence of Lemma 6.2, we have the following.
Remark 6.3.
Let be a tiling and a well-behaved open digital Jordan curve. Then satisfies condition W1 and W2.
To finish this paper we will use the theory we have developed in order to prove a generalization of Rosenfeld’s theorem that we presented on the introduction (Theorem 1.1).
Let be the digital plane. Recall that Rosenfeld works with a squared grid endowed with the -adjacency relations () previously described. If we think of the faces of the digital plane as the points in Rosenfeld’s grid, two faces are -adjacent if . Similarly, we say that they are -adjacent if . We also give the corresponding definition of a simple closed -path with at least five points: is a -Jordan curve if is an open digital Jordan curve such that and for every , has exactly two -adjacent faces in . This reinterpretation of Rosenfeld’s work, motivates the following definition
Definition 6.4.
Let be a tiling and its digital version.
-
(1)
We say that two faces are edge-adjacent (or that and are edge-neighbors) if .
-
(2)
We say that two faces are vertex-adjacent (or that and are vertex-neighbors) if .
-
(3)
A finite secuence of faces is an edge-path of faces (vertex-path of faces) if is edge-adjacent (vertex-adjacent) to and , for every
-
(4)
A set is edge-connected (vertex-connected) if there is an edge-path (vertex-path) between any two elements , such that every element of the path belongs to .
-
(5)
A digital Jordan curve is an edge-Jordan curve, if is open and for every face there are exactly two faces in that are edge-adjacent with .
Let be a tiling and define
Observe that if is an edge-Jordan curve and for a certain , then every element of has exactly two edge-neighbors in , and therefore cannot contain any other face of the tiling. This yields the following remark.
Remark 6.5.
Let be a tiling and be an edge-Jordan curve. If , then is well-behaved.
We can now generalize Rosenfeld’s theorem as follows.
Theorem 6.6.
Let be a tiling with . If is an edge-Jordan curve with then , and these two sets are vertex-connected.
Proof.
Since is a finite set and is infinite, we always have that . On the other hand, by Remark 6.5 and Lemma 6.2, we infer that .
Let us prove that is vertex connected. We know that is connected and closed. Thus, for every we have that .
Claim: For every , . Indeed, if is such that , we can use the fact that is closed to conclude that . Since is an open digital Jordan curve in , Proposition 5.3 guarantees that . Thus, each face of has a common edge with three faces of , which contradicts the definition of . This proves the claim.
Since is a connected Alexandrov space, Theorem 2.5 ensures that is digitally arc connected. Thus for any there is a digital arc of minimum length in from to . We can also assume that contains a maximum number of faces. Since has minimum length, there are at most three consecutive elements of the same tile in . Let
Suppose that . First observe that if , then and would be two consecutive faces in , which is impossible. Thus, . In this situation, is a face of the tiling while is not. If , then , contradicting the fact that is a digital arc. Therefore we infer that , and .
By the claim, we can pick a face . Once again, since is a digital arc, we conclude that and (if ). Thus, , implying that .
For , let
and define . Then is a digital arc from to in containing more faces than . This contradicts the fact that contains a maximum number of faces. Thus, we can conclude that and therefore is a simple vertex-path between and . This proves that is vertex-connected.
Similarly we can prove that is vertex-connected. This completes the proof. ∎
It is clear that Theorem 6.6 directly implies Rosenfeld’s theorem (Theorem 1.1). Moreover, we can also deduce similar results for every grid of points induced by the faces of a regular tiling of the plane, such as the one given by Kopperman in [15, Theorem 26] for a hexagonal grid of points.
Finally, there is a dual theorem, also due to Rosenfeld (see [24, Theorem 3.3]), that is obtained by interchanging the roles of and in Theorem 1.1. To finish this paper, we present a generalization of this result in the context that we have been working on. In order to do this, consider a tiling and define a vertex-Jordan curve as a digital Jordan curve such that and with the property that every has exactly two vertex-neighbors in .
Theorem 6.7.
Let be a tiling with . Suppose that is a vertex-Jordan curve such that . Then
-
(1)
is well-behaved.
-
(2)
and .
-
(3)
and are edge-connected.
Proof.
Since and are the components of , we can find two sets , with open and closed, such that
(1) If is not well-behaved, there exists a vertex , such that . Now, for every , and are vertex-adjacent. Since is a vertex-Jordan curve and , we infer that . Thus
a contradiction.
(2) Since we always have that , we only need to prove the other inequality. By contradiction, assume that . We claim that . Indeed, if , then every element of is an edge. Thus, for every , we get the following inclusions
This implies that . Since is a digital Jordan curve, cannot contain any other element of . This implies that contains only two faces, which contradicts the hypothesis . Therefore and since is well behaved, we infer from Lema 6.2 that contains a face of the tiling. This contradicts the original assumption that .
(3) Since is connected, for any , there exists a digital path completely contained in . Furthermore, we can assume that contains a minimum number of vertices (namely, every other path between and contains at least the same amount of vertices than ).
If contains a vertex, let
In this case and belong to .
Observe that can only contain one element of , at most. Indeed, if , then , because does not have any edge. This implies that and are vertex-adjacent, but since , there must exist two other faces, , different from and , such that is vertex adjacent to and . Hence cannot be a vertex-Jordan curve, a contradiction.
Since induces a cycle in the connectedness graph of , we can find a digital path , where each belongs to . In particular, there are no vertices in . Furthermore, since and , we get that
Therefore the path
is a digital path between and , which is completely contained in and it contains one vertex less than , a contradiction. Thus does not contain any vertex, and therefore if is even and if is odd. Then
is an edge-path of faces, which proves that is edge-connected, as desired. Analogously we can prove that is edge-connected. ∎
References
- [1] P. Alexandrov, Diskrete Räume, Rec. Math., vol. 2 (44), no. 3 (1937), 501–519.
- [2] J. A. Bondy and U. S. R. Murty, Graph Theory, Graduate Texts in Mathematics, Vol. 244, Springer-Verlag, London, 2008.
- [3] R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 174, Springer-Verlag, 3rd Ed., 2005.
- [4] A.W.M. Dress and D. Huson, On tilings of the plane, Geometriae Dedicata, vol. 24 (1987), 295–310.
- [5] R. Engelking, General Topology, Sigma Series in Pure Mathematics, Vol. 6, Berlín, 1989.
- [6] B. Grünbaum and G. C. Shephard, Tilings and Patterns, W. H. Freeman and Company, New York, 1987.
- [7] M. C. Jordan, Cours d’Analyse, Gauthier-Villars, Paris, 1887.
- [8] E. Khalimsky, Applications of Connected Ordered Topological Spaces in Topology, Conference of Math. Departments of Povolsia, 1970.
- [9] E. Khalimsky, Ordered Topological Spaces, Naukova Dumka Press, Kiev, 1977.
- [10] E. Khalimsky, R. Kopperman, and P. R. Meyer, Boundaries in digital planes, Journal of Applied Mathematics and Stochastic Analysis, vol. 3, no. 1 (1990), 27-55.
- [11] E. Khalimsky, R. Kopperman, and P. R. Meyer, Computer graphics and connected topologies on finite ordered sets, Topology and its Applications, vol. 36 (1990), 1-17.
- [12] T. Y. Kong, Digital topology in: Davis L.S. (eds) Foundations of Image Understanding, The Springer International Series in Engineering and Computer Science, vol. 628, Springer, Boston, MA, 2001.
- [13] T. Y. Kong, R. Kopperman, and P. R. Meyer, A topological approach to digital topology, The American Mathematical Monthly, vol. 98, no. 10 (1991), 901-917.
- [14] T. Y. Kong and A. W. Roscoe, A theory of binary digital pictures, Computer Vision, Graphics and Image Processing, vol. 32 (1985), 221-243.
- [15] R. Kopperman, The Khalimsky line as a foundation for digital topology in: O YL., Toet A., Foster D., Heijmans H.J.A.M., Meer P. (eds) Shape in Picture, NATO ASI Series (Series F: Computer and Systems Sciences), vol. 126, Springer, Berlin, Heidelberg, 1994.
- [16] E. Melin, Connectedness and continuity in digital spaces with the Khalimsky topology, Uppsala University, Department of Mathematics, Uppsala, 2003.
- [17] V. Neumann-Lara and R. G. Wilson, Digital Jordan curves — a graph-theoretical approach to a topological theorem, Topology and its Applications, vol. 46 (1992), 263-268.
- [18] D. Renault, The uniform locally finite tilings of the plane, Journal of Combinatorial Theory, Series B, vol. 98 (2008), 651-671.
- [19] A. Rosenfeld, Connectivity in digital pictures, Journal of the Association for Computing Machinery, vol. 17, no. 1 (1970), 146-160.
- [20] A. Rosenfeld, Arcs and curves in digital pictures, Journal of the Association for Computing Machinery, vol. 20, no. 1 (1973), 81-87.
- [21] A. Rosenfeld, Adjacency in digital pictures, Information and Control, vol. 26 (1974), 24-33.
- [22] A. Rosenfeld, A characterization of parallel thinning algorithms, Information and Control, vol. 29 (1975), 286-291.
- [23] A. Rosenfeld, A converse to the Jordan curve theorem for digital curves, Information and Control, vol. 29 (1975), 292-293.
- [24] A. Rosenfeld, Digital topology, The American Mathematical Monthly, vol. 86, no. 8 (1979), 621-630.