blob: 23be194da027339582b31c81990c510b13e3c889 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Vincent Rouvreau
*
* Copyright (C) 2016 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#ifndef INCLUDE_ALPHA_COMPLEX_INTERFACE_H_
#define INCLUDE_ALPHA_COMPLEX_INTERFACE_H_
#include "Alpha_complex_factory.h"
#include <gudhi/Alpha_complex_options.h>
#include "Simplex_tree_interface.h"
#include <iostream>
#include <vector>
#include <string>
#include <memory> // for std::unique_ptr
namespace Gudhi {
namespace alpha_complex {
class Alpha_complex_interface {
public:
Alpha_complex_interface(const std::vector<std::vector<double>>& points, bool fast_version, bool exact_version)
: points_(points),
fast_version_(fast_version),
exact_version_(exact_version) {
}
std::vector<double> get_point(int vh) {
return alpha_ptr_->get_point(vh);
}
void create_simplex_tree(Simplex_tree_interface<>* simplex_tree, double max_alpha_square,
bool default_filtration_value) {
if (points_.size() > 0) {
std::size_t dimension = points_[0].size();
if (dimension == 3 && !default_filtration_value) {
if (fast_version_)
alpha_ptr_ = std::make_unique<Alphacomplex_3D<Gudhi::alpha_complex::complexity::FAST>>(points_);
else if (exact_version_)
alpha_ptr_ = std::make_unique<Alphacomplex_3D<Gudhi::alpha_complex::complexity::EXACT>>(points_);
else
alpha_ptr_ = std::make_unique<Alphacomplex_3D<Gudhi::alpha_complex::complexity::SAFE>>(points_);
if (!alpha_ptr_->create_simplex_tree(simplex_tree, max_alpha_square, default_filtration_value)) {
// create_simplex_tree will fail if all points are on a plane - Retry with dD by setting dimension to 2
dimension--;
alpha_ptr_.reset();
}
}
// Not ** else ** because we have to take into account if 3d fails
if (dimension != 3 || default_filtration_value) {
if (fast_version_) {
alpha_ptr_ = std::make_unique<Inexact_Alphacomplex_dD>(points_, exact_version_);
} else {
alpha_ptr_ = std::make_unique<Exact_Alphacomplex_dD>(points_, exact_version_);
}
alpha_ptr_->create_simplex_tree(simplex_tree, max_alpha_square, default_filtration_value);
}
}
}
private:
std::unique_ptr<Abstract_alpha_complex> alpha_ptr_;
std::vector<std::vector<double>> points_;
bool fast_version_;
bool exact_version_;
};
} // namespace alpha_complex
} // namespace Gudhi
#endif // INCLUDE_ALPHA_COMPLEX_INTERFACE_H_
|
