English
Related papers

Related papers: Digital Topological Complexity of Digital Maps

200 papers

In this paper we analyze some relationships between the topological complexity of a space $X$ and the category of $C_{\Delta_X},$ the homotopy cofibre of the diagonal map $\Delta_X:X\rightarrow X\times X.$ We establish the equality of the…

Algebraic Topology · Mathematics 2012-02-23 J. Calcines , L. Vandembroucq

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

Computational Geometry · Computer Science 2017-09-06 Éric Colin de Verdière

We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…

Algebraic Topology · Mathematics 2017-06-12 D. Fernández-Ternero , E. Macías-Virgós , E. Minuz , J. A. Vilches

Besides per-pixel accuracy, topological correctness is also crucial for the segmentation of images with fine-scale structures, e.g., satellite images and biomedical images. In this paper, by leveraging the theory of digital topology, we…

Computer Vision and Pattern Recognition · Computer Science 2022-10-14 Xiaoling Hu

In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with…

Algebraic Topology · Mathematics 2023-05-24 Melih İs , İsmet Karaca

The spatial character of territorial systems plays a crucial role in the emergence of their complexities. This contribution aims at illustrating to what extent different types of complexities can be exhibited in models of such systems. We…

Physics and Society · Physics 2019-01-29 Juste Raimbault

Using digital topology approach, we construct digital models of closed surfaces as the intersection graphs of LCL covers of the surfaces. It is proved that digital models of closed surfaces are digital 2-dimensional surfaces preserving the…

Computational Geometry · Computer Science 2014-12-02 Alexander V. Evako

We study properties of shy maps in digital topology.

Geometric Topology · Mathematics 2016-06-03 Laurence Boxer

In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…

Algebraic Topology · Mathematics 2020-12-15 Yuli B. Rudyak , Soumen Sarkar

Two objects may be close in the Hausdorff metric, yet have very different geometric and topological properties. We examine other methods of comparing digital images such that objects close in each of these measures have some similar…

Computational Geometry · Computer Science 2021-09-27 Laurence Boxer

Digital topology is part of the ongoing endeavour to understand and analyze digitized images. With a view to supporting this endeavour, many notions from algebraic topology have been introduced into the setting of digital topology. But some…

Algebraic Topology · Mathematics 2019-05-21 Gregory Lupton , John Oprea , Nicholas Scoville

Discrete cubical homology arose as the homology theory associated with discrete cubical homotopy theory. Despite the combinatorial nature of this homology, its computation has posed a significant challenge to the researchers in the field.…

Algebraic Topology · Mathematics 2026-05-13 Samira Sahar Jamil , P Christopher Staecker , Danish Ali

In this article, we investigate properties of digital H-spaces in the graph theoretic model of digital topology. As in prior work, the results obtained often depend fundamentally on the choice between NP$_1$ and NP$_2$ product adjacencies.…

Algebraic Topology · Mathematics 2024-08-20 Wayne A. Johnson , Dae-Woong Lee , P. Christopher Staecker

In this paper I survey some recent results on finite determination, convergence, and approximation of formal mappings between real submanifolds in complex spaces. A number of conjectures are also given.

Complex Variables · Mathematics 2007-05-23 Linda Preiss Rothschild

We study connectivity preserving multivalued functions between digital images. This notion generalizes that of continuous multivalued functions studied mostly in the setting of the digital plane $Z^2$. We show that connectivity preserving…

Computer Vision and Pattern Recognition · Computer Science 2015-12-24 Laurence Boxer , P. Christopher Staecker

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

Combinatorics · Mathematics 2019-03-22 Kohei Tanaka

In this paper, three Computational Topology methods (namely effective homology, persistent homology and discrete vector fields) are mixed together to produce algorithms for homological digital image processing. The algorithms have been…

Computer Vision and Pattern Recognition · Computer Science 2014-12-22 Ana Romero , Julio Rubio , Francis Sergeraert

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…

Computational Geometry · Computer Science 2019-11-20 Alberto Paoluzzi , Vadim Shapiro , Antonio DiCarlo , Francesco Furiani , Giulio Martella , Giorgio Scorzelli

The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real…

Algebraic Topology · Mathematics 2019-08-27 Daniel C. Cohen , Lucile Vandembroucq

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

chao-dyn · Physics 2009-10-22 N. J. Balmforth , E. A. Spiegel , C. Tresser