Recon - A fast algorithm to compute Reeb graphs
-
Updated
Aug 27, 2014 - Java
Recon - A fast algorithm to compute Reeb graphs
A visual exploration framework to track and query cloud systems
Attempt to extract the fundamental group in a semiautomatic and interactive manner
Matlab and Python code to compute perturbed topological signatures (PTS), an efficient topological representation that lies on the Grassmann manifold.
Python implementation of polygon-inclusion algorithm based on the winding number
Simple Ripser wrapper in Julia
Computes a Witness Complex for a given set of landmarks and witnesses.
Utility for reducing an integer matrix to its Smith Normal Form.
Python code to directly compute persistence images (PIs) from data (time-series or images) using deep learning.
Persistent Homology as Stopping-Criterion for Voronoi Interpolation.
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.
AlphaStructures.jl - Theory and Practice of Alpha Shapes for Julia
Topological Data Analysis using Contour Trees
Computation of persistence Steenrod barcodes
New formulas for cup-i products and fast computation of Steenrod squares.
Python bindings and API for the flagser C++ library (https://github.com/luetge/flagser).
A Testing Framework for Decision-Optimization Model Learning Algorithms
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."
A standalone version of Urban Pulse
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."