This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A Jordan Curve Theorem for 2-dimensional Tilings

Diego Fajardo-Rojas, Natalia Jonard-Pérez Departamento de Matemáticas, Facultad de Ciencias, Universidad Nacional Autónoma de México, 04510 Ciudad de México, México. (D. Fajardo-Rojas) [email protected] (N. Jonard-Pérez) [email protected]
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 2\mathbb{R}^{2} 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 2\mathbb{R}^{2}. 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 graph
2020 Mathematics Subject Classification:
Primary: 54H30, 54H99, 54D05, 52C20; Secondary: 05C10, 05C40, 68U05, 54B15, 54D10
Conacyt grant 252849 (México) and by PAPIIT grant IN115819 (UNAM, México).

1. 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 2\mathbb{Z}^{2}. For any point (n,m)2(n,m)\in\mathbb{Z}^{2} Rosenfeld defines its 4-neighbors as the four points (n,m±1)(n,m\pm 1) and (n±1,m)(n\pm 1,m), whilst the four points (n±1,m±1)(n\pm 1,m\pm 1) as well as the 4-neighbors are its 8-neighbors. For k=4k=4 or k=8k=8, a k-path is a finite sequence of points (x0,,xn)(x_{0},\dots,x_{n}) in 2\mathbb{Z}^{2} such that for every i{1,,n}i\in\{1,\dots,n\}, xi1x_{i-1} is a kk-neighbor of xix_{i}. A subset SS of 2\mathbb{Z}^{2} is k-connected if there is a kk-path between any two elements of SS. A k-component of SS is a maximal kk-connected subset. Lastly, a simple closed k-path is a kk-connected set JJ which contains exactly two kk-neighbors for each of its points. In this case we can describe JJ as a kk-path (x1,,xn)(x_{1},\dots,x_{n}), where xix_{i} is a kk-neighbor of xjx_{j} iff ij±1i\equiv j\pm 1 (modulo nn). In [20], Rosenfeld proves the following discrete Jordan curve theorem.

Theorem 1.1.

Let J2J\subset\mathbb{Z}^{2} be a simple closed 44-path with at least five points. Then 2J\mathbb{Z}^{2}\setminus J has exactly two 88-components.

Refer to caption
Figure 1. A simple closed 44-path in 2\mathbb{Z}^{2}.

In the same decade, Efim Khalimsky developed a different approach for studying topological properties of the sets \mathbb{Z} and 2\mathbb{Z}^{2} [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 2\mathbb{R}^{2} 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 2\mathbb{R}^{2} 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 (X,τ)(X,\tau) be a topological space. The topology τ\tau is called an Alexandrov topology if the intersection of an arbitrary family of open sets is open. In this case we say that (X,τ)(X,\tau) is an Alexandrov discrete space.

It is not difficult to see that (X,τ)(X,\tau) is an Alexandrov discrete space iff each point xXx\in X has a smallest neighborhood, which we denote by N(x)N(x). Clearly, N(x)N(x) is the intersection of all open neighborhoods of xx and therefore N(x)N(x) 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 nn\in\mathbb{Z}, let

N(n)={{n}if n is odd,{n1,n,n+1}if n is even.N(n)=\begin{cases}\{n\}&\quad\text{if $n$ is odd,}\\ \{n-1,n,n+1\}&\quad\text{if $n$ is even.}\\ \end{cases}

Then the set of integers \mathbb{Z}, together with the topology τK\tau_{K} given by the base ={N(n)n}\mathcal{B}=\{N(n)\mid n\in\mathbb{Z}\} 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 (,τK)×(,τK)(\mathbb{Z},\tau_{K})\times(\mathbb{Z},\tau_{K}). This product topology coincides with the quotient topology generated by the surjection p:22p:\mathbb{R}^{2}\rightarrow\mathbb{Z}^{2} defined by:

(2.1) p(x,y)={(2n+1,2m+1)if there are n,m such that(x,y)(2n,2n+2)×(2m,2m+2),(2n,2m+1)if there are n,m such thatx=2n,y(2m,2m+2),(2n+1,2m)if there are n,m such thatx(2n,2n+2),y=2m,(2n,2m)if there are n,m such thatx=2n,y=2m.p(x,y)=\begin{cases}(2n+1,2m+1)&\quad\text{if there are $n,m\in\mathbb{N}$ such that}\\ &\quad(x,y)\in(2n,2n+2)\times(2m,2m+2),\\ \\ (2n,2m+1)&\quad\text{if there are $n,m\in\mathbb{N}$ such that}\\ &\quad x=2n,\hskip 5.69046pty\in(2m,2m+2),\\ \\ (2n+1,2m)&\quad\text{if there are $n,m\in\mathbb{N}$ such that}\\ &\quad x\in(2n,2n+2),\hskip 5.69046pty=2m,\\ \\ (2n,2m)&\quad\text{if there are $n,m\in\mathbb{N}$ such that}\\ &\quad x=2n,\hskip 5.69046pty=2m.\\ \end{cases}

It is worth highlighting that the quotient map pp induces an equivalence relation that identifies the interior, the edges (without vertices) and the vertices of the rectangles [2n,2n+2]×[2m,2m+2][2n,2n+2]\times[2m,2m+2] 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 2\mathbb{R}^{2}. 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

N(n,m)={{(n,m)}if 2n2m{n1,n,n+1}×{m1,m,m+1}if 2|n2|m,{n}×{m1,m,m+1}if 2n2|m,{n1,n,n+1}×{m}if 2|n2m.N(n,m)=\begin{cases}\{(n,m)\}&\quad\text{if $2\not|n$, $2\not|m$}\\ \{n-1,n,n+1\}\times\{m-1,m,m+1\}&\quad\text{if $2|n$, $2|m$},\\ \{n\}\times\{m-1,m,m+1\}&\quad\text{if $2\not|n$, $2|m$},\\ \{n-1,n,n+1\}\times\{m\}&\quad\text{if $2|n$, $2\not|m$}.\\ \end{cases}
Refer to caption
Figure 2. The digital plane as equivalence classes of 2\mathbb{R}^{2}.

An important tool to understand the connectedness of an Alexandrov space is its connectedness graph.

Definition 2.3.

Let XX be a topological space. The connectedness graph of XX is the graph G=(VG,EG)G=(V_{G},E_{G}) where VG=XV_{G}=X and {x,y}EG\{x,y\}\in E_{G} if and only if {x,y}\{x,y\} is connected.

We refer the reader to [2] and [3] for any unknown notion concerning graph theory.

Let XX be a topological space. For every xXx\in X the adjacency set of xx is the set

𝒜(x)={yX|xy,{x,y}is connected}.\mathscr{A}(x)=\big{\{}y\in X\leavevmode\nobreak\ |\leavevmode\nobreak\ x\neq y,\hskip 2.84544pt\{x,y\}\hskip 2.84544pt\text{is connected}\big{\}}.

Observe that x𝒜(y)x\in\mathscr{A}(y) if and only if y𝒜(x)y\in\mathscr{A}(x). In this case we say that xx and yy are adjacent.

Given two points x,yXx,y\in X, we define a digital path from xx to yy as a finite sequence of elements of XX, (x0,x1,,xn)(x_{0},x_{1},\dots,x_{n}), such that x=x0x=x_{0}, y=xny=x_{n} and for every i{0,1,,n1}i\in\{0,1,\dots,n-1\}, xix_{i} and xi+1x_{i+1} are adjacent. We say that XX is digitally pathwise connected if for every xx, yXy\in X there is a digital path from xx to yy. Lastly, a digital path (x0,,xn)(x_{0},\dots,x_{n}) is a digital arc if n=1n=1 or if there is a homeomorphism from a finite interval II of the digital line into {x0,,xn}\{x_{0},\dots,x_{n}\}. We say that XX is digitally arcwise connected if for every xx, yXy\in X there is a digital arc from xx to yy.

From the definition of the connectedness graph and the definition of a digital path it is clear that (x0,,xn)(x_{0},\dots,x_{n}) is a digital path in XX if and only if (x0,,xn)(x_{0},\dots,x_{n}) is a path in the connectedness graph GG of XX. The following remark specifies the type of subgraphs in the connectedness graph of XX corresponding to digital arcs. For a proof of the non-trivial implication, see e.g. [16, Theorem 5.6].

Remark 2.4.

Let XX be a topological space. Then (x0,x1,,xn)(x_{0},x_{1},\dots,x_{n}) is a digital arc if and only if (x0,x1,,xn)(x_{0},x_{1},\dots,x_{n}) is an induced simple path in the connectedness graph of XX.

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 XX be an Alexandrov discrete space.

  1. (1)

    For every xXx\in X, 𝒜(x)=(N(x){x}¯){x}.\mathscr{A}(x)=\big{(}N(x)\cup\overline{\{x\}}\big{)}\setminus\{x\}.

  2. (2)

    The following are equivalent:

    1. \rma)

      X is connected.

    2. \rma)

      X is digitally pathwise connected.

    3. \rma)

      X is digitally arcwise connected.

    4. \rma)

      The connectedness graph of XX is connected.

  3. (3)

    The connected components of XX are open and closed.

Finally, we enunciate Khalimsky’s Jordan curve theorem for the digital plane. First, we say that a subset JJ of the digital plane is a Jordan curve in the digital plane if for every jJj\in J the complement J{j}J\setminus\{j\} is a digital arc, and |J|4|J|\geq 4. For a detailed exposition of this theorem, see [11].

Theorem 2.6.

Let JJ be a Jordan curve in the digital plane. Then 2J\mathbb{Z}^{2}\setminus J has exactly two connected components.

2.2. Tilings

To finish this section, let us recall some basic notions about tilings.

Definition 2.7.

Let 𝒯={Tn}n\mathcal{T}=\{T_{n}\}_{n\in\mathbb{N}} be a countable family of closed, connected subsets of 2\mathbb{R}^{2}. We say that 𝒯\mathcal{T} is a tiling of 2\mathbb{R}^{2} if:

  1. (a)

    nTn=2\bigcup_{n\in\mathbb{N}}T_{n}=\mathbb{R}^{2},

  2. (b)

    if iji\neq j, then Int(Ti)Int(Tj)=\operatorname{Int}{(T_{i})}\cap\operatorname{Int}{(T_{j})}=\emptyset.

In this case every element Tn𝒯T_{n}\in\mathcal{T} is called a tile.

Given a tiling 𝒯={Tn}n\mathcal{T}=\{T_{n}\}_{n\in\mathbb{N}} of 2\mathbb{R}^{2}, the points in the plane that are elements of three or more tiles are called vertices. If i,ji,j\in\mathbb{N}, iji\neq j, satisfy that

Ei,j:={u2uTiTj,u is not a vertex},E_{i,j}:=\{u\in\mathbb{R}^{2}\mid u\in T_{i}\cap T_{j},\;u\text{ is not a vertex}\}\neq\emptyset,

then each connected component of the set Ei,jE_{i,j} 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 TT, 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:

  1. (c)

    𝒯\mathcal{T} is a locally finite collection (namely, each point of the plane has a neighborhood that only intersects a finite number of elements of 𝒯\mathcal{T}),

  2. (d)

    for each nn\in\mathbb{N}, TnT_{n} is homeomorphic to the closed unit disk,

  3. (e)

    each edge of the tiling is homeomorphic to the interval (0,1)(0,1),

  4. (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 {[2n,2n+2]×[2m,2m+2]|(n,m)2}\big{\{}[2n,2n+2]\times[2m,2m+2]\hskip 5.69046pt\big{|}\hskip 5.69046pt(n,m)\in\mathbb{Z}^{2}\big{\}} 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 𝒯\mathcal{T} be a tiling.

  1. (1)

    If SS and TT are two tiles such that STS\cap T\neq\emptyset, then ST=STS\cap T=\partial S\cap\partial T.

  2. (2)

    Every tile only intersects a finite number of tiles.

  3. (3)

    Every tile has at least two vertices.

  4. (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 𝒯\mathcal{F}_{\mathcal{T}}, 𝒯\mathcal{E}_{\mathcal{T}} and 𝒱𝒯\mathcal{V}_{\mathcal{T}}, respectively. Lastly, if vv is a vertex, we denote the sets of edges and faces of vv by v\mathcal{E}_{v} and v\mathcal{F}_{v}, 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 𝒯\mathcal{T} be a tiling of 2\mathbb{R}^{2}. Consider the set set 𝒟𝒯:=𝒯𝒯𝒱𝒯\mathcal{D}_{\mathcal{T}}:=\mathcal{F}_{\mathcal{T}}\cup\mathcal{E}_{\mathcal{T}}\cup\mathcal{V}_{\mathcal{T}} and the surjection q:2𝒟𝒯q:\mathbb{R}^{2}\to\mathcal{D}_{\mathcal{T}} given by

(3.1) q(x)={x, if x𝒱𝒯,E, if xE𝒯,F, if xF𝒯.q(x)=\begin{cases}x,&\text{ if }x\in\mathcal{V}_{\mathcal{T}},\\ E,&\text{ if }x\in E\in\mathcal{E}_{\mathcal{T}},\\ F,&\text{ if }x\in F\in\mathcal{F}_{\mathcal{T}}.\end{cases}

Namely, qq identifies the points in the same vertex, edge or face.

Definition 3.1.

The set 𝒟𝒯\mathcal{D}_{\mathcal{T}} equipped with the quotient topology induced by qq is called the digital version of 𝒯\mathcal{T}.

Let 𝒯\mathcal{T} be a tiling of 2\mathbb{R}^{2}. Clearly we have that the closure (in 2\mathbb{R}^{2}) 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 xx in 𝒟𝒯\mathcal{D}_{\mathcal{T}} as follows:

(3.2) {x}¯={{x}if x𝒱𝒯,{x}𝒱xif x𝒯,{x}𝒱xxif x𝒯.\overline{\{x\}}=\begin{cases}\{x\}&\quad\text{if $x\in\mathcal{V}_{\mathcal{T}}$,}\\ \{x\}\cup\mathcal{V}_{x}&\quad\text{if $x\in\mathcal{E}_{\mathcal{T}}$,}\\ \{x\}\cup\mathcal{V}_{x}\cup\mathcal{E}_{x}&\quad\text{if $x\in\mathcal{F}_{\mathcal{T}}$.}\\ \end{cases}

In the following theorem we prove that 𝒟𝒯\mathcal{D}_{\mathcal{T}} is an Alexandrov space, by describing the smallest neighborhood of every element of 𝒟𝒯\mathcal{D}_{\mathcal{T}}.

Theorem 3.2.

Let 𝒯\mathcal{T} be a tiling. Then 𝒟𝒯\mathcal{D}_{\mathcal{T}} is an Alexandrov space. Moreover, for every element x𝒟𝒯x\in\mathcal{D}_{\mathcal{T}} the smallest neigborhood of xx is given by

N(x)={{x}xxif x𝒱𝒯,{x}xif x𝒯,{x}if x𝒯.N(x)=\begin{cases}\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}&\quad\text{if $x\in\mathcal{V}_{\mathcal{T}}$,}\\ \{x\}\cup\mathcal{F}_{x}&\quad\text{if $x\in\mathcal{E}_{\mathcal{T}}$,}\\ \{x\}&\quad\text{if $x\in\mathcal{F}_{\mathcal{T}}$.}\\ \end{cases}
Proof.

Let 𝒯\mathcal{T} be a tiling, q:2𝒟𝒯q:\mathbb{R}^{2}\rightarrow\mathcal{D}_{\mathcal{T}} the quotient map associated to 𝒟𝒯\mathcal{D}_{\mathcal{T}} and x𝒟𝒯x\in\mathcal{D}_{\mathcal{T}} an arbitrary element.

If x𝒱𝒯x\in\mathcal{V}_{\mathcal{T}} and UU is an open neighborhoof of xx, then q1(U)q^{-1}(U) is an open, saturated neighborhood of q1(x)q^{-1}(x). Since xx is a vertex, it is contained in the closure of its edges and faces, therefore q1(U)q^{-1}(U) intersects each element of xx\mathcal{E}_{x}\cup\mathcal{F}_{x}. Moreover, since q1(U)q^{-1}(U) is a saturated neighborhood then q1(U)q^{-1}(U) contains all of the faces and edges of xx, that is, q1({x}xx)q1(U)q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right)\subset q^{-1}(U). Next we see that q1({x}xx)q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right) is an open set. Let yq1({x}xx)y\in q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right). If yy is an element of a face of xx, then that face is an open set contained in q1({x}xx)q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right). If yy is an element of an edge ExE\in\mathcal{E}_{x}, then there are two tiles S,T𝒯S,T\in\mathcal{T} that have xx as a common vertex and such that yESTy\in E\subset S\cap T. Furthermore, for any other tile R𝒯{S,T}R\in\mathcal{T}\setminus\{S,T\}, the point yy does not belong to RR. Since 𝒯{T,S}\mathcal{T}\setminus\{T,S\} is a locally finite collection of closed sets, its union is a closed subset of 2\mathbb{R}^{2} ([5, Theorem 1.1.11.]), thus

2(R𝒯R{S,T}R)\mathbb{R}^{2}\setminus\left(\bigcup_{\begin{subarray}{c}R\in\mathcal{T}\\ R\notin\{S,T\}\end{subarray}}R\right)

is an open neighborhood of yy contained in q1({x}xx)q^{-1}(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}). Finally, if y=q1(x)y=q^{-1}(x) we consider the set 𝒮\mathcal{S} of tiles that contain yy, and we recall that 𝒮\mathcal{S} is a finite set. By the previous argument 2(T(𝒯𝒮)T)\mathbb{R}^{2}\setminus\left(\bigcup_{T\in(\mathcal{T}\setminus\mathcal{S})}T\right) is an open neighborhood of yy that is contained in q1({x}xx)q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right). This proves that q1({x}xx)q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right) is an open set such that

q1({x}xx)q1(U).q^{-1}\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right)\subset q^{-1}(U).

Since UU was an arbitrary open neighborhood of xx in 𝒟𝒯\mathcal{D}_{\mathcal{T}} we conclude that ({x}xx)\left(\{x\}\cup\mathcal{E}_{x}\cup\mathcal{F}_{x}\right) is the smallest neighborhood of xx in 𝒟𝒯\mathcal{D}_{\mathcal{T}}.

If x𝒯x\in\mathcal{E}_{\mathcal{T}} and UU is an open neighborhood of xx, then q1(U)q^{-1}(U) is an open, saturated neighborhood of q1(x)q^{-1}(x). Since xx is an edge we know that it is contained in the closure of its faces, so q1(U)q^{-1}(U) intersects the two elements of x={F1,F2}\mathcal{F}_{x}=\{F_{1},F_{2}\}. Moreover, since q1(U)q^{-1}(U) is a saturated neighborhood then q1(U)q^{-1}(U) contains F1F2F_{1}\cup F_{2}. Thus, q1({x}x)q1(U)q^{-1}\left(\{x\}\cup\mathcal{F}_{x}\right)\subset q^{-1}(U). In the same vein as the previous case, we can see that q1({x}x)q^{-1}\left(\{x\}\cup\mathcal{F}_{x}\right) is open in 2\mathbb{R}^{2}. Since UU is an arbitrary open neighborhood of xx in 𝒟𝒯\mathcal{D}_{\mathcal{T}}, we have that ({x}x)\left(\{x\}\cup\mathcal{F}_{x}\right) is the smallest neighborhood of xx in 𝒟𝒯\mathcal{D}_{\mathcal{T}}.

In order to complete the proof, we see that if x𝒯x\in\mathcal{F}_{\mathcal{T}}, then {x}\{x\} is open in 𝒟𝒯\mathcal{D}_{\mathcal{T}} since xx is the interior of a tile in 2\mathbb{R}^{2}. ∎

We infer from theorems 2.5 and 3.2, in combination with equality 3.2, that the adjacency set of any element x𝒟𝒯x\in\mathcal{D}_{\mathcal{T}} is given by

𝒜(x)={xxif x𝒱𝒯,𝒱xxif x𝒯,𝒱xxif x𝒯.\mathscr{A}(x)=\begin{cases}\mathcal{E}_{x}\cup\mathcal{F}_{x}&\quad\text{if $x\in\mathcal{V}_{\mathcal{T}}$,}\\ \mathcal{V}_{x}\cup\mathcal{F}_{x}&\quad\text{if $x\in\mathcal{E}_{\mathcal{T}}$,}\\ \mathcal{V}_{x}\cup\mathcal{E}_{x}&\quad\text{if $x\in\mathcal{F}_{\mathcal{T}}$.}\\ \end{cases}

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.

Refer to caption
Figure 3. Tiling of the plane with regular hexagons and the connectedness graph of its digital version.

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.

Refer to caption
Figure 4. Tiling of the plane with hexagons and squares and the connectedness graph of its digital version.

For the subsequent material, we recall the definition of a planar graph:

Definition 3.3.

Let G=(VG,EG)G=(V_{G},E_{G}) be a graph. We say that GG is a planar graph if there is a function ψ:VGEG𝒫(2)\psi:V_{G}\cup E_{G}\rightarrow\mathscr{P}(\mathbb{R}^{2}) such that:

  1. (1)

    The image of each element of VGV_{G} is a singleton.

  2. (2)

    The image of each element of EGE_{G} is a subset of 2\mathbb{R}^{2} homeomorphic to (0,1)(0,1).

  3. (3)

    For any two elements x,yVGEGx,y\in V_{G}\cup E_{G}, xyx\neq y,

    ψ(x)ψ(y)=.\psi(x)\cap\psi(y)=\emptyset.
  4. (4)

    If vv and ww are the vertices of the edge ee, then

    ψ(e)¯=ψ(e)ψ(v)ψ(w).\overline{\psi(e)}=\psi(e)\cup\psi(v)\cup\psi(w).

In this situation, we say that |G|:=ψ(VGEG)|G|:=\psi(V_{G}\cup E_{G}) is a planar embedding of GG. Sometimes the set |G||G| is also called a geometric realization of GG.

Lemma 3.4.

Let 𝒯\mathcal{T} be a tiling. The connectedness graph of 𝒱𝒯𝒯\mathcal{V}_{\mathcal{T}}\cup\mathcal{E}_{\mathcal{T}}, with the subspace topology induced by 𝒟𝒯\mathcal{D}_{\mathcal{T}}, is a planar graph.

Proof.

Let H=(VH,EH)H=(V_{H},E_{H}) be the connectedness graph of 𝒱𝒯𝒯\mathcal{V}_{\mathcal{T}}\cup\mathcal{E}_{\mathcal{T}}. The set of vertices of HH is precisely the set VH=𝒱𝒯𝒯V_{H}=\mathcal{V}_{\mathcal{T}}\cup\mathcal{E}_{\mathcal{T}}. We know that the edges of HH always denote the adjacency between an edge of the tiling and its two vertices. Therefore, every edge in EHE_{H} is a pair of the form {A,z}\{A,z\}, where Az𝒯A\in\mathcal{E}_{z}\subset\mathcal{E}_{\mathcal{T}} and z𝒱A𝒱𝒯z\in\mathcal{V}_{A}\subset\mathcal{V}_{\mathcal{T}}. For every A𝒯A\in\mathcal{E}_{\mathcal{T}}, pick a point xAA2x_{A}\in A\subset\mathbb{R}^{2}. If x𝒱𝒯x\in\mathcal{V}_{\mathcal{T}} is a vertex of A𝒯A\in\mathcal{E}_{\mathcal{T}}, we define IxA,xI_{x_{A},x} as the connected component of A{xA}A\setminus\{x_{A}\} delimited by xAx_{A} and xx. It is clear that {xA,x}IxA,x=\{x_{A},x\}\cap I_{x_{A},x}=\emptyset. Since AA is an edge of the tiling, then IxA,xI_{x_{A},x} is homeomorphic to the interval (0,1)(0,1) and

IxA,x¯=IxA,x{xA,x}.\overline{I_{x_{A},x}}=I_{x_{A},x}\cup\{x_{A},x\}.

Moreover, if {xA,x}{xB,y}\{x_{A},x\}\neq\{x_{B},y\} then IxA,xIxB,y=I_{x_{A},x}\cap I_{x_{B},y}=\emptyset, considering that any two different edges of the tiling have an empty intersection. Therefore the function ψ:VHEH𝒫(2)\psi:V_{H}\cup E_{H}\rightarrow\mathscr{P}(\mathbb{R}^{2}) given by

ψ(x)={{x}ifx𝒱𝒯,{xA}ifx=Afor someA𝒯,IxA,zifx={A,z}EH,whereA𝒯andz𝒱𝒯,\psi(x)=\begin{cases}\{x\}&\quad\text{if}\hskip 5.69046ptx\in\mathcal{V}_{\mathcal{T}},\\ \{x_{A}\}&\quad\text{if}\hskip 5.69046ptx=A\hskip 5.69046pt\text{for some}\hskip 5.69046ptA\in\mathcal{E}_{\mathcal{T}},\\ I_{x_{A},z}&\quad\text{if}\hskip 5.69046ptx=\{A,z\}\in E_{H},\hskip 5.69046pt\text{where}\hskip 5.69046ptA\in\mathcal{E}_{\mathcal{T}}\hskip 5.69046pt\text{and}\hskip 5.69046ptz\in\mathcal{V}_{\mathcal{T}},\end{cases}

proves the planarity of HH. ∎

Proposition 3.5.

Let 𝒯\mathcal{T} be a tiling. The connectedness graph of 𝒟𝒯\mathcal{D}_{\mathcal{T}} is a planar graph.

Proof.

Let G=(VG,EG)G=(V_{G},E_{G}) be the connectedness graph of 𝒟𝒯\mathcal{D}_{\mathcal{T}} and H=(VH,EH)H=(V_{H},E_{H}) the connectedness graph of 𝒱𝒯𝒯\mathcal{V}_{\mathcal{T}}\cup\mathcal{E}_{\mathcal{T}}. Then HH is a subgraph of GG and by Lemma 3.4 there is a bijection ψ:VHEH|H|𝒫(2)\psi:V_{H}\cup E_{H}\rightarrow|H|\subset\mathscr{P}(\mathbb{R}^{2}) from the set of vertices and edges of HH to a planar embedding |H||H| of HH. In order to prove the planarity of GG, we want to extend the definition of ψ\psi to a function ϕ:VGEG2\phi:V_{G}\cup E_{G}\rightarrow\mathbb{R}^{2} satisfying conditions (1)-(4) of Definition 3.3. For that purpose, it suffices to define ϕ\phi for every element of 𝒯\mathcal{F}_{\mathcal{T}} and for every edge of GG connecting a face of the tiling with one of its vertices or edges.

Let C𝒯C\in\mathcal{F}_{\mathcal{T}}, we know that there is a unique tile TT that has CC as a face, and we know that 𝒜(C)=𝒱CC\mathscr{A}(C)=\mathcal{V}_{C}\cup\mathcal{E}_{C}. Let γ:𝔹2T\gamma:\mathbb{B}^{2}\rightarrow T be a homeomorphism between 𝔹2\mathbb{B}^{2}, the unit closed disk of 2\mathbb{R}^{2}, and TT. Consider the set γ1(𝒱C)={w1,w2,,wn}\gamma^{-1}(\mathcal{V}_{C})=\{w_{1},w_{2},\dots,w_{n}\}, which is contained in 𝕊1\mathbb{S}^{1} since γ\gamma is a homeomorphism and 𝒱CT\mathcal{V}_{C}\subset\partial T. Without lost of generality we can suppose that w1,,wnw_{1},\dots,w_{n} are numbered clockwise. Then we can number the set γ1(C)={B1,,Bn}\gamma^{-1}(\mathcal{E}_{C})=\{B_{1},\dots,B_{n}\} denoting by B1B_{1} the arc delimited by w1w_{1} and w2w_{2} and then proceeding in a clockwise manner. For every i{1,,n}i\in\{1,\dots,n\}, define Ai:=γ(Bi)A_{i}:=\gamma(B_{i}), considering that γ\gamma is a homeomorphism we can assure that C={A1,,An}\mathcal{E}_{C}=\{A_{1},\dots,A_{n}\}. Being consistent with the notation introduced in Lemma 3.4, we have a point xAiAix_{A_{i}}\in A_{i} such that ψ(Ai)={xAi}\psi(A_{i})=\{x_{A_{i}}\}. Let bi:=γ1(xAi)b_{i}:=\gamma^{-1}(x_{A_{i}}), which is an element of Bi𝕊1(γ1(𝒱C))B_{i}\subset\mathbb{S}^{1}\setminus(\gamma^{-1}(\mathcal{V}_{C})).

For every w{w1,,wn,b1,,bn}w\in\{w_{1},\dots,w_{n},b_{1},\dots,b_{n}\}, let Lw:={tw|t(0,1)}.L_{w}:=\left\{tw\leavevmode\nobreak\ |\leavevmode\nobreak\ t\in(0,1)\right\}. Now we consider the family

C:={Lw|w{w1,,wn,b1,,bn}},\mathcal{L}_{C}:=\left\{L_{w}\leavevmode\nobreak\ |\leavevmode\nobreak\ w\in\{w_{1},\dots,w_{n},b_{1},\dots,b_{n}\}\right\},

whose elements are pairwise disjoint and they are contained in Int𝔹2\operatorname{Int}{\mathbb{B}^{2}}.

Let xC:=γ(0,0)x_{C}:=\gamma(0,0). Since (0,0)Int𝔹2(0,0)\in\operatorname{Int}{\mathbb{B}^{2}}, it follows that xCCx_{C}\in C. Each element of the family γ(C)={γ(L)|LC}\gamma(\mathcal{L}_{C})=\{\gamma(L)\leavevmode\nobreak\ |\leavevmode\nobreak\ L\in\mathcal{L}_{C}\} is an arc delimited by xCx_{C} and one of the points in the set {v1,,vn,xA1,,xAn}\{v_{1},\dots,v_{n},x_{A_{1}},\dots,x_{A_{n}}\}, where vi=γ(wi)𝒱Cv_{i}=\gamma(w_{i})\in\mathcal{V}_{C}. Thus we can denote each arc γ(L)γ(C)\gamma(L)\in\gamma(\mathcal{L}_{C}) as MxC,vM_{x_{C},v}, where vv is the point in {v1,,vn,xA1,,xAn}\{v_{1},\dots,v_{n},x_{A_{1}},\dots,x_{A_{n}}\} that, alongside xCx_{C}, delimits γ(L)\gamma(L). From its definition, it is clear that MxC,v{xC,v}=M_{x_{C},v}\cap\{x_{C},v\}=\emptyset. These arcs are pairwise disjoint, since γ\gamma is a homeomorphism and the elements of C\mathcal{L}_{C} are pairwise disjoint. Also, each arc MxC,vM_{x_{C},v} is contained in CC, since the elements of C\mathcal{L}_{C} are contained in Int𝔹2\operatorname{Int}{\mathbb{B}^{2}}. From here we can infer that if DD is another face of the tiling, then the elements of γ(C)\gamma(\mathcal{L}_{C}) and γ(D)\gamma(\mathcal{L}_{D}) are pairwise disjoint. Furthermore, we can also conclude that the elements of γ(C)\gamma(\mathcal{L}_{C}) do not intersect T\partial T. Lastly, note that MxC,vγ(C)M_{x_{C},v}\in\gamma(\mathcal{L}_{C}) implies

MxC,v¯=MxC,v{xC,v}.\overline{M_{x_{C},v}}=M_{x_{C},v}\cup\{x_{C},v\}.

Therefore the function ϕ:VGEG𝒫(2)\phi:V_{G}\cup E_{G}\rightarrow\mathscr{P}(\mathbb{R}^{2}) given by

ϕ(x)={ψ(x)ifxVHEH,{xC}ifx=Cfor someC𝒯,MxC,vifx={C,v}EGEH,whereC𝒯andv𝒱C,MxC,xAifx={C,A}EGEH,whereC𝒯andAC,\phi(x)=\begin{cases}\psi(x)&\quad\text{if}\hskip 5.69046ptx\in V_{H}\cup E_{H},\\ \{x_{C}\}&\quad\text{if}\hskip 5.69046ptx=C\hskip 5.69046pt\text{for some}\hskip 5.69046ptC\in\mathcal{F}_{\mathcal{T}},\\ M_{x_{C},v}&\quad\text{if}\hskip 5.69046ptx=\{C,v\}\in E_{G}\setminus E_{H},\hskip 5.69046pt\text{where}\hskip 5.69046ptC\in\mathcal{F}_{\mathcal{T}}\hskip 5.69046pt\text{and}\hskip 5.69046ptv\in\mathcal{V}_{C},\\ M_{x_{C},x_{A}}&\quad\text{if}\hskip 5.69046ptx=\{C,A\}\in E_{G}\setminus E_{H},\hskip 5.69046pt\text{where}\hskip 5.69046ptC\in\mathcal{F}_{\mathcal{T}}\hskip 5.69046pt\text{and}\hskip 5.69046ptA\in\mathcal{E}_{C},\\ \end{cases}

proves the planarity of GG. ∎

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 𝒯\mathcal{T} be a tiling. A subset JJ of 𝒟𝒯\mathcal{D}_{\mathcal{T}} is a digital Jordan curve if |J|4|J|\geq 4 and if for every jJj\in J, J{j}J\setminus\{j\} is a digital arc.

Recall that J{j}J\setminus\{j\} is a digital arc in 𝒟𝒯\mathcal{D}_{\mathcal{T}} if and only if J{j}J\setminus\{j\} is an induced simple path in the connectedness graph of 𝒟𝒯\mathcal{D}_{\mathcal{T}} (Remark 2.4). This correspondence allows us to define a Jordan curve in the context of graph theory.

Definition 4.2.

Let GG be a graph. A graph-theoretical Jordan curve is an induced cycle of length equal or greater than four.

Let GG be a graph and xx a vertex of GG. Keeping in mind the correspondence between a topological space and its connectedness graph, we denote by 𝒜(x,G)\mathscr{A}(x,G) the subgraph induced by the vertices of GG adjacent to xx. We say that GG is locally Hamiltonian if for every vertex xx of GG, 𝒜(x,G)\mathscr{A}(x,G) 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 GG is a locally Hamiltonian, connected graph and JGJ\subset G is a graph-theoretical Jordan curve, then

  1. \rma)

    the complement of JJ has at most two connected components in GG,

  2. \rma)

    if GG is planar, then the complement of JJ has exactly two connected components in GG.

It can be seen from Neumann-Lara and Wilson’s proof that if GG is an infinite, planar, locally Hamiltonian and connected graph and JGJ\subset G is a graph-theoretical Jordan curve, then out of the two connected components that make up the complement of JJ in GG, one is bounded whereas the other one is not. We call the set of vertices of the bounded component the interior of VGVJV_{G}\setminus V_{J}, and denote it by I(J)I(J). In a similar manner, the set of vertices of the unbounded component, O(J)O(J), are the exterior of VGVJV_{G}\setminus V_{J}.

Theorem 4.4.

Let 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a digital Jordan curve. Then 𝒟𝒯J\mathcal{D}_{\mathcal{T}}\setminus J has exactly two connected components.

Proof.

Let GG be the connectedness graph of 𝒟𝒯\mathcal{D}_{\mathcal{T}}, it suffices to see that GG satisfies the hypotheses of Theorem 4.3. Let q:2𝒟𝒯q:\mathbb{R}^{2}\rightarrow\mathcal{D}_{\mathcal{T}} be the quotient function associated to the topology of 𝒟𝒯\mathcal{D}_{\mathcal{T}} (see equation 3.1). We know that qq is continuous and therefore the connectedness of 𝒟T\mathcal{D}_{T} is guaranteed by the connectedness of 2\mathbb{R}^{2}. Moreover, we know that 𝒟T\mathcal{D}_{T} is an Alexandrov discrete space, so by Theorem 2.5 we have that GG is connected. In addition, GG is a planar graph by Proposition 3.5.

It only rests us to prove that GG is a locally Hamiltonian graph. By Theorem 3.2, if xx is a vertex of GG we have that:

𝒜(x,G)={xxif x𝒱𝒯,𝒱xxif x𝒯,𝒱xxif x𝒯.\mathscr{A}(x,G)=\begin{cases}\mathcal{E}_{x}\cup\mathcal{F}_{x}&\quad\text{if $x\in\mathcal{V}_{\mathcal{T}}$,}\\ \mathcal{V}_{x}\cup\mathcal{F}_{x}&\quad\text{if $x\in\mathcal{E}_{\mathcal{T}}$,}\\ \mathcal{V}_{x}\cup\mathcal{E}_{x}&\quad\text{if $x\in\mathcal{F}_{\mathcal{T}}$.}\\ \end{cases}

If x𝒱𝒯x\in\mathcal{V}_{\mathcal{T}}, we know that at least three tiles intersect in xx. Each of these tiles has exactly two edges whose vertex is xx. This fact allows us to infer that if we consider the set x\mathcal{E}_{x} (which is finite) and we number their elements clockwise, then every two consecutive edges determine a face of xx (and none of these faces is determined by two different pairs of edges). We also know that every edge of xx is determined by exactly two faces of xx. Lastly, we know that in the connectedness graph there are no two adjacent edges nor two adjacent faces. Thus the subgraph induced by xx\mathcal{E}_{x}\cup\mathcal{F}_{x} 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 x𝒯x\in\mathcal{E}_{\mathcal{T}}, xx has exactly two vertices and two faces, furthermore, both vertices are vertices of both faces. For that reason the subgraph of GG induced by 𝒱xx\mathcal{V}_{x}\cup\mathcal{F}_{x} is a cycle with exactly four vertices.

Finally, if x𝒯x\in\mathcal{F}_{\mathcal{T}} we recall the analysis made in Proposition 3.5 to conclude that the vertices and edges of xx alternate in x\partial x, allowing us to verify that 𝒱xx\mathcal{V}_{x}\cup\mathcal{E}_{x} is a cycle.

In any case, we have proved that the subgraph induced by 𝒜(x,G)\mathscr{A}(x,G) is a cycle and thus GG is locally Hamiltonian. In addition, we know that since JJ is a digital Jordan curve, then the subgraph induced by JJ in GG is a graph-theoretical Jordan curve. Hence, by Theorem 4.3 we can conclude that GJG\setminus J has exactly two connected components in GG.

To finish the proof, recall that 𝒟𝒯\mathcal{D}_{\mathcal{T}} is an Alexandrov space. Since GJG\setminus J has exactly two connected components in GG, by Theorem 2.5 we have that 𝒟𝒯J\mathcal{D}_{\mathcal{T}}\setminus J has exactly two connected components. Moreover, we know that the connected components of 𝒟𝒯J\mathcal{D}_{\mathcal{T}}\setminus J are precisely the vertices of the connected components of GJG\setminus J; in other words, the connected components of 𝒟𝒯J\mathcal{D}_{\mathcal{T}}\setminus J are its interior I(J)I(J), which is bounded, and its exterior O(J)O(J), 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 C1,C2𝒯C_{1},C_{2}\in\mathcal{F}_{\mathcal{T}} (where 𝒯\mathcal{T} is the tiling of Example 2.8) there is a homeomorphism from the digital plane into itself that maps C1C_{1} to C2C_{2}. 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 JJ that satisfy two conditions:

  • (W1)

    half of the elements of JJ are faces of the tiling (and they alternate with the non-faces elements of the curve).

  • (W2)

    JJ encloses a face of the tiling (namely, I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset).

Lemma 5.1.

Let 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a digital Jordan curve. Then, for every xJx\in J, 𝒜(x)I(J)\mathscr{A}(x)\cap I(J)\neq\emptyset.

Proof.

Let xJx\in J and let GG be the connectedness graph of 𝒟𝒯\mathcal{D}_{\mathcal{T}}. We proceed by contradiction. Suppose that 𝒜(x)I(J)=\mathscr{A}(x)\cap I(J)=\emptyset and let x0x_{0} and x1x_{1} be the two adjacent points to xx in JJ. It is clear that x0x_{0} and x1x_{1} are not adjacent. We know that the subgraph induced by 𝒜(x)\mathscr{A}(x) is a cycle with at least four elements. For that reason there are two paths contained in 𝒜(x,G)\mathscr{A}(x,G) that only intersect at x0x_{0} and x1x_{1}. Let aa and bb be two vertices, different from x0x_{0} and x1x_{1}, in each of these paths. Since 𝒜(x)I(J)=\mathscr{A}(x)\cap I(J)=\emptyset, then, with the exception of x0x_{0} and x1x_{1}, the vertices of the paths we mentioned earlier are contained in O(J)O(J). In particular, a,bO(J)a,b\in O(J).

Since 𝒯\mathcal{T} is a tiling, GG is a planar graph and thus there is a map ψ:VGEG𝒫(2)\psi:V_{G}\cup E_{G}\to\mathscr{P}(\mathbb{R}^{2}) that attests the planarity of GG. Let HH be the subgraph induced by the vertices VH:=I(J)JV_{H}:=I(J)\cup J in GG. Being a subgraph of GG, HH is a planar graph too. Since 𝒜(x)I(J)=\mathscr{A}(x)\cap I(J)=\emptyset, we have that 𝒜(x)(I(J)J)={x0,x1}\mathscr{A}(x)\cap(I(J)\cup J)=\{x_{0},x_{1}\}, therefore xx is a vertex of exactly two faces of HH. Let C\mathrm{C} be the cycle that determines the bounded face of HH having xx as a vertex (the other face contains the exterior face of the subgraph induced by the vertices of JJ). Then we know that ψ(C)\bigcup\psi(\mathrm{C}) is the boundary of a set D\mathrm{D}, homeomorphic to a closed disk, and that ψ(x0),ψ(x),ψ(x1)ψ(C)=D\psi(x_{0}),\psi(x),\psi(x_{1})\subset\bigcup\psi(\mathrm{C})=\partial\mathrm{D}.

Now we construct a graph Γ\Gamma with the set of vertices VΓ=VG{p}V_{\Gamma}=V_{G}\cup\{p\}, where pVGp\notin V_{G}, and the set of edges EΓ=EG{{p,w}|wVC}E_{\Gamma}=E_{G}\cup\left\{\{p,w\}\leavevmode\nobreak\ |\leavevmode\nobreak\ w\in V_{\mathrm{C}}\right\}. We sustain that Γ\Gamma is a planar graph. Indeed, since D\mathrm{D} is homeomorphic to a closed disk and ψ(x0),ψ(x),ψ(x1)D\psi(x_{0}),\psi(x),\psi(x_{1})\subset\partial\mathrm{D}, we can replicate the construction of the point xCx_{C} and the sets MxC,vM_{x_{C},v} in the proof of Proposition 3.5 to prove the existence of a point xpIntDx_{p}\in\operatorname{Int}\mathrm{D} and sets Mxp,wIntDM_{x_{p},w}\subset\operatorname{Int}\mathrm{D} such that the function ϕ:VΓEΓ𝒫(2)\phi:V_{\Gamma}\cup E_{\Gamma}\rightarrow\mathscr{P}(\mathbb{R}^{2}) defined as

ϕ(x)={ψ(x)ifxVGEG,{xp}ifx=p,Mxp,wifxEΓEG,wherepandwVCare the vertices ofx,\phi(x)=\begin{cases}\psi(x)&\quad\text{if}\hskip 5.69046ptx\in V_{G}\cup E_{G},\\ \{x_{p}\}&\quad\text{if}\hskip 5.69046ptx=p,\\ M_{x_{p},w}&\quad\text{if}\hskip 5.69046ptx\in E_{\Gamma}\setminus E_{G},\hskip 5.69046pt\text{where}\hskip 5.69046ptp\hskip 5.69046pt\text{and}\hskip 5.69046ptw\in V_{\mathrm{C}}\\ &\quad\text{are the vertices of}\hskip 5.69046ptx,\\ \end{cases}

proves the planarity of Γ\Gamma.

However, if we take a look at the sets of vertices {p,a,b}\{p,a,b\} and {x0,x,x1}\{x_{0},x,x_{1}\}, we see that Γ\Gamma contains a subdivision of a complete bipartite graph K3,3K_{3,3}, which contradicts Kuratowski’s theorem ([3, Theorem 4.4.6]). Therefore we have proved that 𝒜(x)I(J)\mathscr{A}(x)\cap I(J)\neq\emptyset. ∎

Proposition 5.2.

Let 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a digital Jordan curve. The following are equivalent:

  1. \rma)

    JJ is closed.

  2. \rma)

    I(J)I(J) and O(J)O(J) are open.

  3. \rma)

    JJ is nowhere dense.

  4. \rma)

    I(J)O(J)I(J)\cup O(J) is dense.

  5. \rma)

    J𝒯=J\cap\mathcal{F}_{\mathcal{T}}=\emptyset.

  6. \rma)

    J=(I(J))J=\partial(I(J)).

Proof.

a)\impliesb). I(J)O(J)I(J)\cup O(J) is the complement of JJ and thus it is open. In addition, since 𝒟𝒯\mathcal{D}_{\mathcal{T}} is an Alexandrov space, Theorem 2.5 guarantees that I(J)I(J) and O(J)O(J) are open and closed in I(J)O(J)I(J)\cup O(J), because they are the connected components of I(J)O(J)I(J)\cup O(J). Since the latter is open in 𝒟𝒯\mathcal{D}_{\mathcal{T}}, we conclude that I(J)I(J) and O(J)O(J) are also open in 𝒟𝒯.\mathcal{D}_{\mathcal{T}}.

b)\impliesc). We prove the contrapositive. Suppose there is an element xInt(J¯)x\in\operatorname{Int}{\left(\overline{J}\right)}. This implies that N(x)J¯N(x)\subset\overline{J}. In particular, we have that xJ¯x\in\overline{J} and hence {x}¯J¯\overline{\{x\}}\subset\overline{J}. Thus 𝒜(x){x}J¯\mathscr{A}(x)\cup\{x\}\subset\overline{J}. In this situation, J¯\overline{J} can not be a digital Jordan curve since the connectedness graph of 𝒜(x){x}\mathscr{A}(x)\cup\{x\} contains at least one vertex, one edge and one face adjacent to each other; in other words, the connectedness graph of 𝒜(x){x}\mathscr{A}(x)\cup\{x\} contains cycles of length 33. For that reason, JJ is not closed and therefore I(J)O(J)I(J)\cup O(J) is not open, which in turn implies that b) is false.

c)\impliesd). Suppose that I(J)O(J)I(J)\cup O(J) is not dense. Since 𝒟𝒯\mathcal{D}_{\mathcal{T}} is the disjoint union of I(J)I(J), O(J)O(J) and JJ, there is a point xJx\in J such that N(x)(I(J)O(J))=N(x)\cap\left(I(J)\cup O(J)\right)=\emptyset. Therefore N(x)JN(x)\subset J, so xInt(J)x\in\operatorname{Int}(J) and thus Int(J¯)\operatorname{Int}{\left(\overline{J}\right)}\neq\emptyset.

d)\impliese). Assume there is a point xJ𝒯x\in J\cap\mathcal{F}_{\mathcal{T}}. Thus N(x)={x}JN(x)=\{x\}\subset J. Since J(I(J)O(J))=J\cap\left(I(J)\cup O(J)\right)=\emptyset, we have that N(x)(I(J)O(J))=N(x)\cap\left(I(J)\cup O(J)\right)=\emptyset and therefore I(J)O(J)I(J)\cup O(J) cannot be dense.

e)\impliesf). First let us prove that JJ is closed. By e), the elements of JJ 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 JJ, the vertices of each edge in JJ are contained in JJ. Therefore the closure of each element of JJ is contained in JJ. Since 𝒟𝒯\mathcal{D}_{\mathcal{T}} is an Alexandrov discrete space this implies that JJ is closed.

Now by the implication a)\impliesb), we infer that I(J)I(J) and O(J)O(J) are open. This proves that (I(J))=(I(J))¯I(J)\partial(I(J))=\overline{(I(J))}\setminus I(J). Furthermore, since 𝒟𝒯\mathcal{D}_{\mathcal{T}} is the disjoint union of JJ, I(J)I(J) and O(J)O(J), we conclude that I(J)JI(J)\cup J is a closed set that contains I(J)I(J). Thus

(I(J))=(I(J))¯I(J)(I(J)J)I(J)=J.\partial(I(J))=\overline{(I(J))}\setminus I(J)\subset(I(J)\cup J)\setminus I(J)=J.

It rests us to prove that J(I(J))J\subset\partial(I(J)). Since I(J)I(J) and JJ are disjoint sets, it is enough to prove that N(x)I(J)N(x)\cap I(J)\neq\emptyset for every xJx\in J. Let xJx\in J, by Lemma 5.1 we have that 𝒜(x)I(J)\mathscr{A}(x)\cap I(J)\neq\emptyset. If xx is an edge, then the elements of N(x)N(x) are xx and its two faces, and the elements of 𝒜(x)\mathscr{A}(x) are the two faces and the two vertices of xx. We know that JJ and I(J)I(J) are disjoint, and that the vertices of xx are contained in JJ. Thus 𝒜(x)I(J)\mathscr{A}(x)\cap I(J) contains at least one of the faces of xx, implying that N(x)I(J)N(x)\cap I(J)\neq\emptyset. Lastly, if xx is a vertex, then 𝒜(x)N(x)\mathscr{A}(x)\subset N(x) and therefore N(x)I(J)N(x)\cap I(J)\neq\emptyset. In any case, J(I(J))J\subset\partial(I(J)).

f)\impliesa). 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 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a digital Jordan curve. The following are equivalent:

  1. (a)

    JJ is open.

  2. (b)

    I(J)I(J) and O(J)O(J) are closed.

  3. (c)

    J𝒱𝒯=J\cap\mathcal{V}_{\mathcal{T}}=\emptyset.

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 JJ is an open digital Jordan curve, then I(J)I(J) is closed, so for every xI(J)x\in I(J), {x}¯I(J)\overline{\{x\}}\subset I(J), and whether xx is a vertex, an edge or a face, {x}¯\overline{\{x\}} always contains a vertex of the tiling. This reasoning yields the following remark.

Remark 5.4.

If JJ is an open digital curve, then I(J)𝒱𝒯I(J)\cap\mathcal{V}_{\mathcal{T}}\neq\emptyset.

However, we cannot guarantee that I(J)I(J) 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.

Refer to caption
Figure 5. A digital Jordan curve and its interior.

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 JJ 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 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a digital Jordan curve. We say that JJ is well-behaved if for every C𝒯JC\in\mathcal{F}_{\mathcal{T}}\cap J and every x𝒱Cx\in\mathcal{V}_{C}, xJ\mathcal{F}_{x}\not\subset J.

Clearly the curve of Figure 5 is not well-behaved.

Lemma 6.2.

Let 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a well-behaved digital Jordan curve. If 𝒱𝒯I(J)\mathcal{V}_{\mathcal{T}}\cap I(J)\neq\emptyset (in particular, if JJ is a well-behaved open digital jordan curve), then 𝒯I(J)\mathcal{F}_{\mathcal{T}}\cap I(J)\neq\emptyset.

Proof.

Since I(J)I(J) and O(J)O(J) are the components of Y:=I(J)O(J)Y:=I(J)\cup O(J), we can find an open set U𝒟𝒯U\subset\mathcal{D}_{\mathcal{T}} such that UY=I(J)U\cap Y=I(J). Thus,

I(J)UI(J)J.I(J)\subset U\subset I(J)\cup J.

Assume that 𝒯I(J)=\mathcal{F}_{\mathcal{T}}\cap I(J)=\emptyset, and pick an element x𝒱𝒯I(J)x\in\mathcal{V}_{\mathcal{T}}\cap I(J). Notice that

xN(x)UI(J)J.\mathcal{F}_{x}\subset N(x)\subset U\subset I(J)\cup J.

Now, we can use the assumption that 𝒯I(J)=\mathcal{F}_{\mathcal{T}}\cap I(J)=\emptyset to conclude that xJ\mathcal{F}_{x}\subset J, which is impossible because JJ is well-behaved. Therefore 𝒯I(J)\mathcal{F}_{\mathcal{T}}\cap I(J)\neq\emptyset, as desired. ∎

As an immediate consequence of Lemma 6.2, we have the following.

Remark 6.3.

Let 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} a well-behaved open digital Jordan curve. Then JJ 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 𝒟𝒯\mathcal{D}_{\mathcal{T}} be the digital plane. Recall that Rosenfeld works with a squared grid endowed with the kk-adjacency relations (k{4,8}k\in\{4,8\}) previously described. If we think of the faces of the digital plane as the points in Rosenfeld’s grid, two faces C1,C2𝒯C_{1},C_{2}\in\mathcal{F}_{\mathcal{T}} are 44-adjacent if C1C2\mathcal{E}_{C_{1}}\cap\mathcal{E}_{C_{2}}\neq\emptyset. Similarly, we say that they are 88-adjacent if 𝒱C1𝒱C2\mathcal{V}_{C_{1}}\cap\mathcal{V}_{C_{2}}\neq\emptyset. We also give the corresponding definition of a simple closed 44-path with at least five points: J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} is a 44-Jordan curve if JJ is an open digital Jordan curve such that |𝒯J|5|\mathcal{F}_{\mathcal{T}}\cap J|\geq 5 and for every C𝒯JC\in\mathcal{F}_{\mathcal{T}}\cap J, CC has exactly two 44-adjacent faces in JJ. This reinterpretation of Rosenfeld’s work, motivates the following definition

Definition 6.4.

Let 𝒯\mathcal{T} be a tiling and 𝒟𝒯\mathcal{D}_{\mathcal{T}} its digital version.

  1. (1)

    We say that two faces C1,C2𝒯C_{1},C_{2}\in\mathcal{F}_{\mathcal{T}} are edge-adjacent (or that C1C_{1} and C2C_{2} are edge-neighbors) if C1C2\mathcal{E}_{C_{1}}\cap\mathcal{E}_{C_{2}}\neq\emptyset.

  2. (2)

    We say that two faces C1,C2𝒯C_{1},C_{2}\in\mathcal{F}_{\mathcal{T}} are vertex-adjacent (or that C1C_{1} and C2C_{2} are vertex-neighbors) if 𝒱C1𝒱C2\mathcal{V}_{C_{1}}\cap\mathcal{V}_{C_{2}}\neq\emptyset.

  3. (3)

    A finite secuence of faces (C0,,Cn)(C_{0},\dots,C_{n}) is an edge-path of faces (vertex-path of faces) if CiC_{i} is edge-adjacent (vertex-adjacent) to Ci+1C_{i+1} and Ci1C_{i-1}, for every i=1,,n1.i=1,\dots,n-1.

  4. (4)

    A set Y𝒟𝒯𝒯Y\subset\mathcal{D}_{\mathcal{T}}\cap\mathcal{F}_{\mathcal{T}} is edge-connected (vertex-connected) if there is an edge-path (vertex-path) between any two elements C1,C2YC_{1},C_{2}\in Y, such that every element of the path belongs to YY.

  5. (5)

    A digital Jordan curve J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} is an edge-Jordan curve, if JJ is open and for every face CJ𝒯C\in J\cap\mathcal{F}_{\mathcal{T}} there are exactly two faces in JJ that are edge-adjacent with CC.

Let 𝒯\mathcal{T} be a tiling and define

Δ(𝒯)=sup{|x|}x𝒱𝒯.\Delta(\mathcal{T})=\sup\{|\mathcal{F}_{x}|\}_{x\in\mathcal{V}_{\mathcal{T}}}.

Observe that if JJ is an edge-Jordan curve and xJ\mathcal{F}_{x}\subset J for a certain x𝒱xx\in\mathcal{V}_{x}, then every element of x\mathcal{F}_{x} has exactly two edge-neighbors in JJ, and therefore JJ cannot contain any other face of the tiling. This yields the following remark.

Remark 6.5.

Let 𝒯\mathcal{T} be a tiling and J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} be an edge-Jordan curve. If |J𝒯|Δ(𝒯)+1|J\cap\mathcal{F}_{\mathcal{T}}|\geq\Delta(\mathcal{T})+1, then JJ is well-behaved.

We can now generalize Rosenfeld’s theorem as follows.

Theorem 6.6.

Let 𝒯\mathcal{T} be a tiling with Δ(𝒯)<\Delta(\mathcal{T})<\infty. If J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} is an edge-Jordan curve with |J𝒯|Δ(𝒯)+1,|J\cap\mathcal{F}_{\mathcal{T}}|\geq\Delta(\mathcal{T})+1, then I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset, O(J)𝒯O(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset and these two sets are vertex-connected.

Proof.

Since I(J)JI(J)\cup J is a finite set and 𝒯\mathcal{F}_{\mathcal{T}} is infinite, we always have that O(J)𝒯O(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset. On the other hand, by Remark 6.5 and Lemma 6.2, we infer that I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset.

Let us prove that I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}} is vertex connected. We know that I(J)I(J) is connected and closed. Thus, for every C𝒯I(J)C\in\mathcal{F}_{\mathcal{T}}\cap I(J) we have that 𝒱CCI(J)\mathcal{V}_{C}\cup\mathcal{E}_{C}\subset I(J).

Claim: For every A𝒯I(J)A\in\mathcal{E}_{\mathcal{T}}\cap I(J), AI(J)\mathcal{F}_{A}\cap I(J)\neq\emptyset. Indeed, if A𝒯I(J)A\in\mathcal{E}_{\mathcal{T}}\cap I(J) is such that AI(J)=\mathcal{F}_{A}\cap I(J)=\emptyset, we can use the fact that O(J)O(J) is closed to conclude that AJ\mathcal{F}_{A}\subset J. Since JJ is an open digital Jordan curve in 𝒟𝒯\mathcal{D}_{\mathcal{T}}, Proposition 5.3 guarantees that J𝒱𝒯=J\cap\mathcal{V}_{\mathcal{T}}=\emptyset. Thus, each face of AA has a common edge with three faces of JJ, which contradicts the definition of JJ. This proves the claim.

Since I(J)I(J) is a connected Alexandrov space, Theorem 2.5 ensures that I(J)I(J) is digitally arc connected. Thus for any C1,C2I(J)𝒯C_{1},C_{2}\in I(J)\cap\mathcal{F}_{\mathcal{T}} there is a digital arc of minimum length α0=(x0=C1,x1,,xn=C2)\alpha_{0}=(x_{0}=C_{1},x_{1},\dots,x_{n}=C_{2}) in I(J)I(J) from C1C_{1} to C2C_{2}. We can also assume that α0\alpha_{0} contains a maximum number of faces. Since α0\alpha_{0} has minimum length, there are at most three consecutive elements of the same tile in α0\alpha_{0}. Let

m:=max{kik:x2i𝒯}.m:=\max\{k\in\mathbb{N}\mid\forall i\leq k:x_{2i}\in\mathcal{F}_{\mathcal{T}}\}.

Suppose that mn2m\neq\frac{n}{2}. First observe that if 2m=n12m=n-1, then x2mx_{2m} and xnx_{n} would be two consecutive faces in α0\alpha_{0}, which is impossible. Thus, 02m<n10\leq 2m<n-1. In this situation, x2mx_{2m} is a face of the tiling while x2m+2x_{2m+2} is not. If x2m+1x2mx_{2m+1}\in\mathcal{E}_{x_{2m}}, then x2m+2𝒱x2mx_{2m+2}\in\mathcal{V}_{x_{2m}}, contradicting the fact that α0\alpha_{0} is a digital arc. Therefore we infer that x2m+1𝒱x2mx_{2m+1}\in\mathcal{V}_{x_{2m}}, x2m+2𝒯x2mx_{2m+2}\in\mathcal{E}_{\mathcal{T}}\setminus\mathcal{E}_{x_{2m}} and x2m+1𝒱x2m+2x_{2m+1}\in\mathcal{V}_{x_{2m+2}}.

By the claim, we can pick a face Cx2m+2I(J)C\in\mathcal{F}_{x_{2m+2}}\cap I(J). Once again, since α0\alpha_{0} is a digital arc, we conclude that Cα0C\notin\alpha_{0} and x2m+3𝒱Cx_{2m+3}\in\mathcal{V}_{C} (if 2m+2<n2m+2<n). Thus, {x2m0+1,x2m0+2,x2m0+3}{C}¯\{x_{2m_{0}+1},x_{2m_{0}+2},x_{2m_{0}+3}\}\subset\overline{\{C\}}, implying that x2m0+4{Cx2m0+2}¯x_{2m_{0}+4}\notin\overline{\{C_{x_{2m_{0}+2}}\}}.

For i{0,,n}i\in\{0,\dots,n\}, let

yi={xiifi2m0+2,Cifi=2m0+2.y_{i}=\begin{cases}x_{i}&\quad\text{if}\hskip 5.69046pti\neq 2m_{0}+2,\\ C&\quad\text{if}\hskip 5.69046pti=2m_{0}+2.\\ \end{cases}

and define α1:=(y0,y1,,yn)\alpha_{1}:=(y_{0},y_{1},\dots,y_{n}). Then α1\alpha_{1} is a digital arc from C1C_{1} to C2C_{2} in I(J)I(J) containing more faces than α0\alpha_{0}. This contradicts the fact that α0\alpha_{0} contains a maximum number of faces. Thus, we can conclude that m=n2m=\frac{n}{2} and therefore (x0,x2,,x2m)(x_{0},x_{2},\dots,x_{2m}) is a simple vertex-path between C1C_{1} and C2C_{2}. This proves that I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}} is vertex-connected.

Similarly we can prove that O(J)𝒯O(J)\cap\mathcal{F}_{\mathcal{T}} 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 44 and 88 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 𝒯\mathcal{T} and define a vertex-Jordan curve as a digital Jordan curve J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} such that J𝒯𝒱𝒯J\subset\mathcal{F}_{\mathcal{T}}\cup\mathcal{V}_{\mathcal{T}} and with the property that every C𝒯JC\in\mathcal{F}_{\mathcal{T}}\cap J has exactly two vertex-neighbors in JJ.

Theorem 6.7.

Let 𝒯\mathcal{T} be a tiling with Δ(𝒯)<\Delta(\mathcal{T})<\infty. Suppose that J𝒟𝒯J\subset\mathcal{D}_{\mathcal{T}} is a vertex-Jordan curve such that |J𝒯|Δ(𝒯)+1|J\cap\mathcal{F}_{\mathcal{T}}|\geq\Delta(\mathcal{T})+1. Then

  1. (1)

    JJ is well-behaved.

  2. (2)

    I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset and O(J)𝒯O(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset.

  3. (3)

    I(J)𝒯I(J)\cap\mathcal{F}_{\mathcal{T}} and O(J)𝒯O(J)\cap\mathcal{F}_{\mathcal{T}} are edge-connected.

Proof.

Since I(J)I(J) and O(J)O(J) are the components of Y:=I(J)O(J)Y:=I(J)\cup O(J), we can find two sets U,K𝒟𝒯U,K\subset\mathcal{D}_{\mathcal{T}}, with UU open and KK closed, such that

UY=I(J)=KY.U\cap Y=I(J)=K\cap Y.

(1) If JJ is not well-behaved, there exists a vertex x𝒱𝒯x\in\mathcal{V}_{\mathcal{T}}, such that xJ\mathcal{F}_{x}\subset J. Now, for every C1,C2xC_{1},C_{2}\in\mathcal{F}_{x}, C1C_{1} and C2C_{2} are vertex-adjacent. Since JJ is a vertex-Jordan curve and |x|3|\mathcal{F}_{x}|\geq 3, we infer that J𝒯=xJ\cap\mathcal{F}_{\mathcal{T}}=\mathcal{F}_{x}. Thus

|x|=|J𝒯|Δ(𝒯)+1|x|+1,|\mathcal{F}_{x}|=|J\cap\mathcal{F}_{\mathcal{T}}|\geq\Delta(\mathcal{T})+1\geq|\mathcal{F}_{x}|+1,

a contradiction.

(2) Since we always have that O(J)𝒯O(J)\cap\mathcal{F}_{\mathcal{T}}\neq\emptyset, we only need to prove the other inequality. By contradiction, assume that I(J)𝒯=I(J)\cap\mathcal{F}_{\mathcal{T}}=\emptyset. We claim that 𝒱𝒯I(J)\mathcal{V}_{\mathcal{T}}\cap I(J)\neq\emptyset. Indeed, if 𝒱𝒯I(J)=\mathcal{V}_{\mathcal{T}}\cap I(J)=\emptyset, then every element of I(J)I(J) is an edge. Thus, for every EI(J)E\in I(J), we get the following inclusions

EN(E)UI(J)J and 𝒱E{E}¯KI(J)J.\mathcal{F}_{E}\subset N(E)\subset U\subset I(J)\cup J\;\text{ and }\;\mathcal{V}_{E}\subset\overline{\{E\}}\subset K\subset I(J)\cup J.

This implies that 𝒜(E)=𝒱EEJ\mathscr{A}(E)=\mathcal{V}_{E}\cup\mathcal{F}_{E}\subset J. Since JJ is a digital Jordan curve, JJ cannot contain any other element of 𝒟𝒯\mathcal{D}_{\mathcal{T}}. This implies that JJ contains only two faces, which contradicts the hypothesis |J𝒯|Δ(𝒯)+1|J\cap\mathcal{F}_{\mathcal{T}}|\geq\Delta(\mathcal{T})+1. Therefore 𝒱𝒯I(J)\mathcal{V}_{\mathcal{T}}\cap I(J)\neq\emptyset and since JJ is well behaved, we infer from Lema 6.2 that I(J)I(J) contains a face of the tiling. This contradicts the original assumption that I(J)𝒯=I(J)\cap\mathcal{F}_{\mathcal{T}}=\emptyset.

(3) Since I(J)I(J) is connected, for any C1,C2I(J)𝒯C_{1},C_{2}\in I(J)\cap\mathcal{F}_{\mathcal{T}}, there exists a digital path α0=(C1=x0,x1,,xn=C2)\alpha_{0}=(C_{1}=x_{0},x_{1},\dots,x_{n}=C_{2}) completely contained in I(J)I(J). Furthermore, we can assume that α0\alpha_{0} contains a minimum number of vertices (namely, every other path between C1C_{1} and C2C_{2} contains at least the same amount of vertices than α0\alpha_{0}).

If α0\alpha_{0} contains a vertex, let

m:=min{k{1,,n}xk is a vertex}.m:=\min\{k\in\{1,\dots,n\}\mid x_{k}\text{ is a vertex}\}.

In this case xm1x_{m-1} and xm+1x_{m+1} belong to 𝒜(xm)=xmxm\mathscr{A}(x_{m})=\mathcal{E}_{x_{m}}\cup\mathcal{F}_{x_{m}}.

Observe that 𝒜(xm)\mathscr{A}(x_{m}) can only contain one element of JJ, at most. Indeed, if D1,D2J𝒜(xm)D_{1},D_{2}\in J\cap\mathscr{A}(x_{m}), then {D1,D2}xm\{D_{1},D_{2}\}\subset\mathcal{F}_{x_{m}}, because JJ does not have any edge. This implies that D1D_{1} and D2D_{2} are vertex-adjacent, but since xmJx_{m}\notin J, there must exist two other faces, D,DJD,D^{\prime}\in J, different from D1D_{1} and D2D_{2}, such that D1D_{1} is vertex adjacent to DD and DD^{\prime}. Hence JJ cannot be a vertex-Jordan curve, a contradiction.

Since 𝒜(xm)\mathscr{A}(x_{m}) induces a cycle in the connectedness graph of 𝒟𝒯\mathcal{D}_{\mathcal{T}}, we can find a digital path β=(xm1=y0,y1,,yk=xm+1)\beta=(x_{m-1}=y_{0},y_{1},\dots,y_{k}=x_{m+1}), where each yiy_{i} belongs to 𝒜(xm)J\mathscr{A}(x_{m})\setminus J. In particular, there are no vertices in β\beta. Furthermore, since N(xm)UI(J)JN(x_{m})\subset U\subset I(J)\cup J and {xm}¯KI(J)J\overline{\{x_{m}\}}\subset K\subset I(J)\cup J, we get that

{y1,,yk}𝒜(xm)J(I(J)J)J=I(J).\{y_{1},\dots,y_{k}\}\subset\mathscr{A}(x_{m})\setminus J\subset\big{(}I(J)\cup J\big{)}\setminus J=I(J).

Therefore the path

α1:=(C1=x0,,xm1,y1,,yk1,xm+1,,xn=C2)\alpha_{1}:=(C_{1}=x_{0},\dots,x_{m-1},y_{1},\dots,y_{k-1},x_{m+1},\dots,x_{n}=C_{2})

is a digital path between C1C_{1} and C2C_{2}, which is completely contained in I(J)I(J) and it contains one vertex less than α0\alpha_{0}, a contradiction. Thus α0\alpha_{0} does not contain any vertex, and therefore xk𝒯x_{k}\in\mathcal{F}_{\mathcal{T}} if kk is even and xk𝒯x_{k}\in\mathcal{E}_{\mathcal{T}} if kk is odd. Then

α:=(C1=x0,x2,,xn=C2)\alpha:=(C_{1}=x_{0},x_{2},\dots,x_{n}=C_{2})

is an edge-path of faces, which proves that I(J)I(J) is edge-connected, as desired. Analogously we can prove that O(J)O(J) 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.