Graphs with a path partition for structuring digital spaces
From MaRDI portal
Publication:2446382
DOI10.1016/j.ins.2013.01.011zbMath1284.05310OpenAlexW2092288337MaRDI QIDQ2446382
Publication date: 16 April 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.01.011
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Digital Jordan curves and surfaces with respect to a graph connectedness ⋮ A closure operator for the digital plane ⋮ Terse walk sets in graphs and induced closure operators ⋮ Closure operators on graphs for modeling connectedness in digital spaces ⋮ A convenient graph connectedness for digital imagery ⋮ Galois connections between sets of paths and closure operators in simple graphs ⋮ Some variants of strong normality in closure spaces generated via relations ⋮ Categorical aspects of inducing closure operators on graphs by sets of walks ⋮ Homotopic properties of an \textit{MA}-digitization of 2D Euclidean spaces ⋮ Path-induced closure operators on graphs for defining digital Jordan surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Boundaries in digital planes
- Computer graphics and connected topologies on finite ordered sets
- A quotient-universal digital topology
- A Jordan surface theorem for three-dimensional digital spaces
- A digital analogue of the Jordan curve theorem
- Digital Jordan curves
- Continuous digitization in Khalimsky spaces
- A theory of binary digital pictures
- Digital Topology
- A Topological Approach to Digital Topology
- Connectivity in Digital Pictures
This page was built for publication: Graphs with a path partition for structuring digital spaces