12#ifndef PERSISTENCE_INTERVALS_WITH_DISTANCES_H_
13#define PERSISTENCE_INTERVALS_WITH_DISTANCES_H_
21#include <gudhi/Persistence_intervals.h>
22#include <gudhi/Bottleneck.h>
23#include <gudhi/Debug_utils.h>
26namespace Persistence_representations {
58 double power = std::numeric_limits<double>::max(),
59 double tolerance = (std::numeric_limits<double>::min)())
const
61 if (power >= std::numeric_limits<double>::max()) {
65 std::cerr <<
"At the moment Gudhi do not support Wasserstein distances. We only support Bottleneck distance."
68 throw std::logic_error(
69 "At the moment Gudhi do not support Wasserstein distances. We only support Bottleneck distance.");
This class implements the following concepts: Vectorized_topological_data, Topological_data_with_dist...
Definition Persistence_intervals_with_distances.h:42
double distance(const Persistence_intervals_with_distances &second, double power=std::numeric_limits< double >::max(), double tolerance=(std::numeric_limits< double >::min)()) const
Computes the distance to the persistence diagram given as a parameter.
Definition Persistence_intervals_with_distances.h:57
Persistence_intervals(const char *filename, unsigned int dimension=std::numeric_limits< unsigned int >::max())
Constructor from a text file.
Definition Persistence_intervals.h:64
Persistence_intervals(const char *filename, unsigned int dimension=std::numeric_limits< unsigned int >::max())
Constructor from a text file.
Definition Persistence_intervals.h:64
double bottleneck_distance(const Persistence_diagram1 &diag1, const Persistence_diagram2 &diag2, double e=(std::numeric_limits< double >::min)())
Function to compute the Bottleneck distance between two persistence diagrams.
Definition Bottleneck.h:116
Gudhi namespace.
Definition SimplicialComplexForAlpha.h:14