pulsatrix 1.1.0
Loading...
Searching...
No Matches
rips_persistence.hpp
Go to the documentation of this file.
1
23#pragma once
24
25#include <array>
26#include <cstdint>
27#include <vector>
28
31
32namespace pulsatrix {
33
45 double threshold = -1;
48 int coefficient = 2;
51 bool cocycles = false;
52};
53
57 std::vector<int64_t> vertices;
59 int coefficient = 0;
60};
61
68 std::array<int64_t, 2> birth_edge{{-1, -1}};
71 std::array<int64_t, 2> death_edge{{-1, -1}};
77 std::vector<CocycleEntry> cocycle;
78};
79
81struct RipsResult {
84 std::vector<PersistenceDiagram> diagrams;
86 std::vector<std::vector<RipsFeature>> features;
88 double threshold = 0;
89};
90
102[[nodiscard]] RipsResult ComputeRipsPersistence(const DistanceMatrix& distances, const RipsOptions& options = {});
103
104} // namespace pulsatrix
Pairwise Euclidean distances of a point cloud, computed with one GEMM on any backend,...
Definition acquisition_functions.hpp:16
RipsResult ComputeRipsPersistence(const DistanceMatrix &distances, const RipsOptions &options={})
Persistent homology of the Vietoris-Rips filtration on the given distances, in dimensions 0 to option...
A persistence diagram: the features of one homology dimension, each born at one scale and dying at a ...
One simplex of a cocycle with its coefficient.
Definition rips_persistence.hpp:55
std::vector< int64_t > vertices
The simplex's vertices, in increasing order. Its orientation is that order.
Definition rips_persistence.hpp:57
int coefficient
Its value in Z/p, in [0, p).
Definition rips_persistence.hpp:59
The distances between every pair of n points, condensed.
Definition distance_matrix.hpp:56
One feature of a persistence diagram.
Definition persistence_diagram.hpp:15
One feature of the diagram, with where it comes from.
Definition rips_persistence.hpp:63
std::array< int64_t, 2 > birth_edge
The edge whose length is the birth: the longest edge of the simplex that creates the feature,...
Definition rips_persistence.hpp:68
std::array< int64_t, 2 > death_edge
The edge whose length is the death: the longest edge of the simplex that kills it....
Definition rips_persistence.hpp:71
PersistencePair pair
Its birth and death.
Definition rips_persistence.hpp:65
std::vector< CocycleEntry > cocycle
With RipsOptions::cocycles, for dimension 1 and above: a cocycle that represents the feature....
Definition rips_persistence.hpp:77
ComputeRipsPersistence()'s settings.
Definition rips_persistence.hpp:35
int coefficient
The prime p of the coefficient field Z/p. 2 is the usual choice; a larger prime is what circular coor...
Definition rips_persistence.hpp:48
double threshold
The largest scale; simplices with a larger diameter are left out. A negative value (the default) uses...
Definition rips_persistence.hpp:45
bool cocycles
Return each feature's representative cocycle. They can be large: one entry per simplex its reduction ...
Definition rips_persistence.hpp:51
int max_dimension
The highest homology dimension to compute: 1 for loops, 2 for voids. At most 8.
Definition rips_persistence.hpp:37
ComputeRipsPersistence()'s result.
Definition rips_persistence.hpp:81
std::vector< PersistenceDiagram > diagrams
One diagram per dimension, 0 to max_dimension; each carries the distances' error_bound.
Definition rips_persistence.hpp:84
std::vector< std::vector< RipsFeature > > features
features[d][k] describes diagrams[d].pairs[k].
Definition rips_persistence.hpp:86
double threshold
The threshold used.
Definition rips_persistence.hpp:88