Relation-induced connectedness in the digital plane

DOI10.1007/S00010-017-0508-5MaRDI QIDQ1692282zbMATH OpenOpenAlexFDO

Authors Josef Šlapal

Publication date 26 January 2018

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00010-017-0508-5

zbMATH Keywords

\(n\)-ary relationconnectednessdigital planeJordan curve theoremKhalimsky topology

Mathematics Subject Classification ID

Discrete geometry (52C99) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Review text

Processing of digital images forces the use of a digital plane with a convenient structure. An important criterion of such a convenience is the validity of a digital analogue of the Jordan curve theorem. The classical approach is based on using 4-adjacency and 8-adjacency graphs for structuring the digital plane. Unfortunately, neither the 4-adjacency nor the 8-adjacency graph alone allows for an analogue of the Jordan curve theorem. In this paper a connectedness induced by \(n\)-ary relations on their underlying sets is introduced. In particular, certain \(n\)-ary relations with the induced connectedness allowing for a definition of digital Jordan curves are considered. For every integer one such \(n\)-ary relation is introduced on the digital plane and a digital analogue of the Jordan curve theorem for the induced connectedness is proven. The \(n\)-ary relations provide convenient structures on the digital plane for the study of geometric properties of digital images, esspecialy those that are related to boundaries.

Recommendations

• Adjacencies for Structuring the Digital Plane
• scientific article; zbMATH DE number 6897325
• Connectedness of offset digitizations in higher dimensions
• scientific article; zbMATH DE number 1257192
• Connectedness and its applications
• A convenient graph connectedness for digital imagery
• Closure operators on graphs for modeling connectedness in digital spaces
• Convenient adjacencies for structuring the digital plane
• Connectivity of discrete planes

Cites work

• A Jordan surface theorem for three-dimensional digital spaces
• A theory of binary digital pictures
• A Topological Approach to Digital Topology
• Boundaries in digital planes
• Computer graphics and connected topologies on finite ordered sets
• Connectivity in Digital Pictures
• Continuous digitization in Khalimsky spaces
• Digital Topology
• Graph theory
• scientific article; zbMATH DE number 4212126 (Why is no real title available?)
• scientific article; zbMATH DE number 3581219 (Why is no real title available?)
• scientific article; zbMATH DE number 2079715 (Why is no real title available?)
• Jordan curve theorems with respect to certain pretopologies on \(\mathbb Z^2\)
• Topological structuring of the digital plane
• Topologies for the digital spaces and

Cited in

(12)

• Concepts of digital topology
• A 3D digital Jordan-Brouwer separation theorem
• scientific article; zbMATH DE number 6897325 (Why is no real title available?)
• Adjacencies for Structuring the Digital Plane
• Concurrency Relations between Digital Planes
• Digital Jordan curves and surfaces with respect to a closure operator
• Convenient adjacencies for structuring the digital plane
• A relational generalization of the Khalimsky topology
• Compatible adjacency relations for digital products
• Product space and the digital plane via relations
• Digital Jordan surfaces arising from tetrahedral tiling
• A digital 3D Jordan-Brouwer separation theorem

This page was built for publication: Relation-induced connectedness in the digital plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1692282)