Topological Complexities of Finite Digital Images
From MaRDI portal
Abstract: Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a digitally connected finite digital image. We present all possible cases of the topological complexity TC of a finite digital image in Z and Z^2$. Finally, we determine the higher topological complexity TC_{n} of finite irreducible digital images independently of the number of points for n > 1.
Recommendations
- The higher topological complexity in digital images
- The topology of digital images
- Graph topology on finite digital images
- Topological invariants in digital images
- Homotopy equivalence in finite digital images
- Digital imaging: a unified topological framework
- A unified topological framework for digital imaging
- Homotopy in two-dimensional digital images
- scientific article; zbMATH DE number 1104457
- Certain topological methods for computing digital topological complexity
Cites work
- A classical construction for the digital fundamental group
- Applications of the Lefschetz number to digital images
- Connectivity in Digital Pictures
- Digital Lusternik–Schnirelmann category
- Digital products, wedges, and covering spaces
- Digital topological complexity numbers
- Digital topological method for computing genus and the Betti numbers
- Digitally continuous functions
- Fixed point sets in digital topology. I
- Fixed point sets in digital topology. II
- Fundamental groups for digital products
- Fuzzy digital topology
- Homotopy equivalence in finite digital images
- Homotopy properties of sphere-like digital images
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- Invitation to topological robotics
- Lefschetz fixed point theorem for digital images
- On higher analogs of topological complexity
- Properties of digital homotopy
- Surfaces in three-dimensional digital images
- The higher topological complexity in digital images
- Topological complexity of motion planning
- Topological structures in computer science
Cited in
(16)- The topology of digital images
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
- A combinatorial description of topological complexity for finite spaces
- Topology on digital label images
- Estimation of the complexity of a digital image from the viewpoint of fixed point theory
- scientific article; zbMATH DE number 1104457 (Why is no real title available?)
- Minimal non-simple sets in 4D binary images
- Digital topological complexity numbers
- The higher topological complexity in digital images
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION
- Computer Algebra in Scientific Computing
- Certain topological methods for computing digital topological complexity
- Digital topological groups
- Strong digital topological complexity of digital maps
- Counterexamples for topological complexity in digital images
- Proximal motion planning algorithms
This page was built for publication: Topological Complexities of Finite Digital Images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076474)
