Allowing cycles in discrete Morse theory
From MaRDI portal
Publication:2401549
DOI10.1016/j.topol.2017.05.008zbMath1373.68427OpenAlexW2619870690WikidataQ59388565 ScholiaQ59388565MaRDI QIDQ2401549
Aldo Gonzalez-Lorenzo, Pedro Real, Jean-Luc Mari, Alexandra Bac
Publication date: 4 September 2017
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.topol.2017.05.008
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Abstract complexes in algebraic topology (55U05)
Related Items
A heuristic for short homology basis of digital objects ⋮ A computational framework for connection matrix theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intrinsic volumes of random cubical complexes
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Morphological characterization of the diblock copolymer problem with topological computation
- Coreduction homology algorithm for inclusions and persistent homology
- Coreduction homology algorithm for regular CW-complexes
- Distributed computation of coverage in sensor networks by homological methods
- Searching high order invariants in computer imagery
- An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group
- Index pairs algorithms
- Chain homotopies for object topological representations
- Coreduction homology algorithm
- Homology computation by reduction of chain complexes
- Combinatorial vector fields and dynamical systems
- Nonconstructible simplicial balls and a way of testing constructibility
- Morse theory for cell complexes
- A user's guide to discrete Morse theory
- Computational homology
- Computing persistent homology
- On the cohomology of 3D digital images
- Homological spanning forest framework for 2D image analysis
- Zigzag persistence
- On discrete Morse functions and combinatorial decompositions
- Computation of cubical homology, cohomology, and (co)homological operations via chain contraction
- Lectures on polyhedral topology
- On the dunce hat
- Improved bound for complexity of matrix multiplication
- CAPD::RedHom v2 - Homology Software Based on Reduction Algorithms
- Verified Homology Computations for Nodal Domains
- Electromagnetic Theory and Computation
- Discrete Morse Functions from Fourier Transforms
- Discrete Geometry for Computer Imagery
- Toward Optimality in Discrete Morse Theory
- Zigzag persistent homology in matrix multiplication time
- Random Discrete Morse Theory and a New Library of Triangulations
- Computing Optimal Morse Matchings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Combinatorial algebraic topology
This page was built for publication: Allowing cycles in discrete Morse theory
