A Jordan curve theorem for 2-dimensional tilings (Q2049889)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Jordan curve theorem for 2-dimensional tilings
scientific article

    Statements

    A Jordan curve theorem for 2-dimensional tilings (English)
    0 references
    27 August 2021
    0 references
    In this paper the authors study the Jordan curve theorem, which is valid for every locally finite tiling of \(\mathbb{R}^2\). (Thus, they state that the tilings that they are based on are locally finite collections.) They also generalize the Jordan curve theorem for grids of points, including Rosenfeld's theorem. Firstly, they introduce the meaning of the digital version of a tiling \(\mathcal{T}\) of \(\mathbb{R}^2\), denoted by \(\mathcal{D}_T\), and prove basic properties of these topological spaces. One of the main results related to \(\mathcal{D}_T\) is given as follows: \begin{itemize} \item Let \(\mathcal{T}\) be a tiling. Then \(\mathcal{D}_T\) is an Alexandrov space. \end{itemize} Moreover, they generalize the definition of Jordan curve, introducing the notion of a digital Jordan curve. With this the authors prove the main theorem of the paper, which is stated as follows: \begin{itemize} \item Let \(\mathcal{T}\) be a tiling and \(J\subset \mathcal{D}_T\) be a digital Jordan curve. Then \(\mathcal{D}_T\setminus J\) has exactly two connected components. \end{itemize} In addition, they study open and closed digital Jordan curves and insert the notion of the well-behaved digital Jordan curve. Based on this theory they present a generalization of Rosenfeld's theorem.
    0 references
    digital plane
    0 references
    tiling
    0 references
    Alexandrov topologies
    0 references
    Jordan curve
    0 references
    simple closed curve
    0 references
    cycle in graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references