A convenient graph connectedness for digital imagery

DOI10.1007/978-3-030-67077-1_9zbMath1474.68442OpenAlexW3119822486MaRDI QIDQ2234045

Josef Šlapal

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-67077-1_9

zbMATH Keywords

connectednessdigital planeKhalimsky topologyJordan curve theoremsimple undirected graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boundaries in digital planes
• Computer graphics and connected topologies on finite ordered sets
• A Jordan surface theorem for three-dimensional digital spaces
• Correction to: ``A de Bruijn-Erdős theorem in graphs?
• Graphs with a path partition for structuring digital spaces
• Continuous digitization in Khalimsky spaces
• Convenient adjacencies on Z2
• A Jordan Curve Theorem in the Digital Plane
• A theory of binary digital pictures
• Jordan Curve Theorems with Respect to Certain Pretopologies on $\mathbb Z^2$
• Digital Topology
• A Topological Approach to Digital Topology
• Connectivity in Digital Pictures

This page was built for publication: A convenient graph connectedness for digital imagery