Computation of persistence Steenrod barcodes
-
Updated
May 30, 2022 - Jupyter Notebook
Computation of persistence Steenrod barcodes
Simple Ripser wrapper in Julia
Utility for reducing an integer matrix to its Smith Normal Form.
A visual exploration framework to track and query cloud systems
Persistent Homology as Stopping-Criterion for Voronoi Interpolation.
New formulas for cup-i products and fast computation of Steenrod squares.
A fork to optimize interval matching in the bootstrap case; also extends to data with arbitrary (precomputed) distance metrics.
Computes a Witness Complex for a given set of landmarks and witnesses.
Attempt to extract the fundamental group in a semiautomatic and interactive manner
This repository contains exercises that were given to the students of the course "Computational Topology" at University of Potsdam in 2022. The courses contents were based on Herbert Edelsbrunners "Computational Topology: An Introduction."
AlphaStructures.jl - Theory and Practice of Alpha Shapes for Julia
Computing Betti numbers from simplicial complexes.
Cecher: efficient computation of Čech persistence barcodes
A Testing Framework for Decision-Optimization Model Learning Algorithms
Julia library providing functionality for modeling Simplicial Complexes and Cochains over them. Its main feature is a clean interface to calculate Betti numbers and Hodge decompositions.
Python implementation of polygon-inclusion algorithm based on the winding number
This project uses topological methods to track evasion paths in mobile sensor networks.
Matlab and Python code to compute perturbed topological signatures (PTS), an efficient topological representation that lies on the Grassmann manifold.
Add a description, image, and links to the computational-topology topic page so that developers can more easily learn about it.
To associate your repository with the computational-topology topic, visit your repo's landing page and select "manage topics."