Local computation of homology variations over a construction process
DOI10.1016/J.CAGD.2020.101907zbMATH Open1505.55012OpenAlexW3032906679MaRDI QIDQ2197935FDOQ2197935
Authors: Wassim Rharbaoui, Sylvie Alayrangues, P. Lienhardt, Samuel Peltier
Publication date: 1 September 2020
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2020.101907
Recommendations
- Homology computation during an incremental construction process
- Computing Homology: A Global Reduction Approach
- Topological computation of local cohomology multiplicities
- scientific article; zbMATH DE number 589390
- Localized homology
- scientific article; zbMATH DE number 1978331
- Homology Computation
- Computing homology
- Homology over local homomorphisms
- scientific article; zbMATH DE number 1390164
Persistent homology and applications, topological data analysis (55N31) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- The Gudhi library: simplicial complexes and persistent homology
- \textsc{Phat} -- persistent homology algorithms toolbox
- Barcodes of towers and a streaming algorithm for persistent homology
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed computation of persistent homology
- Persistent cohomology and circular coordinates
- Title not available (Why is that?)
- Basic Linear Algebra Subprograms for Fortran Usage
- Homologie singulière des espaces fibrés. Applications
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Computational homology
- Zigzag persistent homology and real-valued functions
- Title not available (Why is that?)
- On the algebra of cubes
- Clear and compress: computing persistent homology in chunks
- Computing topological persistence for simplicial maps (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smooth surfaces for multi-scale shape representation
- Geometric and topological inference
- Simploidal sets: a data structure for handling simploidal Bézier spaces
- Combinatorial maps. Efficient data structures for computer graphics and image processing
Cited In (4)
Uses Software
This page was built for publication: Local computation of homology variations over a construction process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197935)