BIRS Workshop Lecture Videos
Multi starts at one: Efficient computation of Vietorisâ Rips persistence barcodes Bauer, Ulrich
I will discuss the efficient computation of the Vietorisâ Rips persistence barcode for a finite metric space. The implementation in the C++ code â Ripserâ focuses on memory and time efficiency, outperforming previous software on typical benchmark examples both in terms of time and memory. The improved computational efficiency is based on a close connection between persistent homology and discrete Morse theory, together with novel algorithmic design principles, avoiding the explicit construction of the filtration boundary matrix.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International