A convenient graph connectedness for digital imagery
From MaRDI portal
Publication:2234045
DOI10.1007/978-3-030-67077-1_9zbMATH Open1474.68442OpenAlexW3119822486MaRDI QIDQ2234045FDOQ2234045
Authors: Josef Šlapal 
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-67077-1_9
Recommendations
- Dynamic connectivity in digital images
- Graph topology on finite digital images
- A theoretical tour of connectivity in image processing and analysis
- A general data structure for image analysis based on a description of connected components
- Polyhedral Representation and Adjacency Graph in n-dimensional Digital Images
- Persistent homology of graph-like digital images
- Connectivity preserving transformations for higher dimensional binary images
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Digital Topology
- Connectivity in Digital Pictures
- A Jordan surface theorem for three-dimensional digital spaces
- Computer graphics and connected topologies on finite ordered sets
- Title not available (Why is that?)
- A Topological Approach to Digital Topology
- Title not available (Why is that?)
- Boundaries in digital planes
- Continuous digitization in Khalimsky spaces
- Jordan curve theorems with respect to certain pretopologies on \(\mathbb Z^2\)
- Correction to: ``A de Bruijn-Erdős theorem in graphs?
- A theory of binary digital pictures
- Graphs with a path partition for structuring digital spaces
- Convenient adjacencies on \(\mathbb Z^2\)
- A Jordan Curve Theorem in the Digital Plane
Cited In (7)
- Convenient adjacencies on \(\mathbb Z^2\)
- Digital Jordan curves---a graph-theoretical approach to a topological theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connected components of sets of finite perimeter and applications to image processing
- Relation-induced connectedness in the digital plane
- Convenient adjacencies for structuring the digital plane
This page was built for publication: A convenient graph connectedness for digital imagery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234045)
