TTK base class that computes the persistence diagram of a Rips complex of a planar point cloud using a fast, dedicated algorithm. More...

#include <FastRipsPersistenceDiagram2.h>

Detailed Description

TTK base class that computes the persistence diagram of a Rips complex of a planar point cloud using a fast, dedicated algorithm.

Author: Mattéo Clémot matte.nosp@m.o.cl.nosp@m.emot@.nosp@m.univ.nosp@m.-lyon.nosp@m.1.fr

Date: January 2024.

This module defines the FastRipsPersistenceDiagram2 class that takes a planar point cloud and computes the persistence diagram of its Rips complex using a geometric-only algorithm based on the computation of the relative neighborhood graph (RNG) and minmax length (MML) triangulations.

Related publication
"Topological Autoencoders++: Fast and Accurate Cycle-Aware Dimensionality Reduction"
MattÃ©o ClÃ©mot, Julie Digne, Julien Tierny,
IEEE Transactions on Visualization and Computer Graphics. Accepted, to be presented at IEEE VIS 2026.

The documentation for this class was generated from the following file:

/home/julien/Pro/git/github/thomas/ttk-dani/core/base/ripsPersistenceDiagram/FastRipsPersistenceDiagram2.h