Pairwise Euclidean distances of a point cloud, computed with one GEMM on any backend,...
Definition acquisition_functions.hpp:16
H0Result ComputeH0(const DistanceMatrix &distances)
H0 persistence of the Vietoris-Rips filtration on the given distances.
std::vector< int64_t > SingleLinkageClusters(const std::vector< MstEdge > &edges, int64_t points, double threshold)
The clusters of single linkage cut at a scale: points joined by tree edges no longer than threshold s...
A persistence diagram: the features of one homology dimension, each born at one scale and dying at a ...
The distances between every pair of n points, condensed.
Definition distance_matrix.hpp:56
ComputeH0()'s result.
Definition h0.hpp:36
PersistenceDiagram diagram
The H0 diagram: one pair (0, length) for each tree edge of positive length, and one essential pair (0...
Definition h0.hpp:42
std::vector< MstEdge > edges
The n - 1 edges of a minimum spanning tree, by increasing length (ties by a, then b)....
Definition h0.hpp:45
One edge of a minimum spanning tree.
Definition h0.hpp:27
float length
Its length: the scale at which it merges two components.
Definition h0.hpp:32
int64_t b
Definition h0.hpp:30
int64_t a
Its endpoints, a < b.
Definition h0.hpp:29
The features of one homology dimension: H0 for components, H1 for loops, H2 for voids.
Definition persistence_diagram.hpp:32