Strong digital topological complexity of digital maps
naive digital topological complexitysectional categorystrong digital homotopic distancestrong digital homotopytopological complexity
Graph operations (line graphs, products, etc.) (05C76) Applications of general topology to computer science (e.g., digital topology, image processing) (54H30) Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Computational aspects of digital topology (68U03)
In [Discrete Comput. Geom. 29, No. 2, 211--221 (2003; Zbl 1038.68130)], \textit{M. Farber} investigated a notion of topological complexity for the motion planning problem as a number which measures discontinuity of the process of motion planning in the configuration space by using the methods of the Lusternik-Schnirelman theory. In [Topology Appl. 157, No. 5, 916--920 (2010; Zbl 1187.55001)], \textit{Y. B. Rudyak} introduced a series of numerical invariants which can be regarded as higher topological complexity of a topological space and calculated these invariants in the case of a sphere.\N\NIn the paper under review, the authors explore a notion of digital topological complexity of a digitally continuous function, and the strong digital \(f\)-sectional category of a digitally continuous function \(p : E \rightarrow B\), where \(f : B \rightarrow X\) is a digitally continuous function. They also present the relationship between the strong digital topological complexity and the ordinary digital ones, and consider the naive digital topological complexity of digitally continuous functions.
- A topologist's view of kinematic maps and manipulation complexity
- Digital homotopic distance between digital functions
- Digital Lusternik–Schnirelmann category
- Digital shy maps
- Digital topological complexity numbers
- Digital Topology on Graphs
- Discrete topological complexity
- Foundations of a connectivity theory for simplicial complexes
- Graph homotopy and Graham homotopy
- Higher discrete homotopy groups of graphs
- Hom complexes and homotopy theory in the category of graphs
- Homotopy groups of Hom complexes of graphs
- Homotopy theory in digital topology
- Homotopy theory of graphs
- Homotopy types of the Hom complexes of graphs
- Invitation to topological robotics
- On geometric and topological reasoning in robotics
- On the topological complexity of maps
- Simplicial simple-homotopy of flag complexes in terms of graphs
- Strong homotopy in finite topological adjacency category
- Strong homotopy induced by adjacency structure
- The higher topological complexity in digital images
- Topological Complexities of Finite Digital Images
- Topological complexity of a map
- Topological complexity of motion planning
- Topological complexity of the work map
- Topology and the robot arm
This page was built for publication: Strong digital topological complexity of digital maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545213)
