Bottleneck_distance/bottleneck_basic_example.cpp
#include <gudhi/Bottleneck.h>
#include <iostream>
#include <vector>
#include <utility> // for pair
#include <limits> // for numeric_limits
int main() {
std::vector< std::pair<double, double> > v1, v2;
v1.emplace_back(2.7, 3.7);
v1.emplace_back(9.6, 14.);
v1.emplace_back(34.2, 34.974);
v1.emplace_back(3., std::numeric_limits<double>::infinity());
v2.emplace_back(2.8, 4.45);
v2.emplace_back(9.5, 14.1);
v2.emplace_back(3.2, std::numeric_limits<double>::infinity());
std::cout << "Bottleneck distance = " << b << std::endl;
std::cout << "Approx bottleneck distance = " << b << std::endl;
}
Gudhi::persistence_diagram::bottleneck_distance
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:112
GUDHI  Version 3.1.1  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Mon Apr 25 2022 14:03:04 for GUDHI by Doxygen 1.8.17