summaryrefslogtreecommitdiff
path: root/matching/include/simplex.h
blob: e0a654bf0f842f04bd79d9403c7eefaa196161f0 (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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#ifndef MATCHING_DISTANCE_SIMPLEX_H
#define MATCHING_DISTANCE_SIMPLEX_H

#include <algorithm>
#include <vector>
#include <ostream>

#include "common_util.h"

namespace md {

    class Bifiltration;

    enum class BifiltrationFormat {
        rene, rivet
    };

    class AbstractSimplex {
    private:
        std::vector<int> vertices_;
    public:

        // this member is for convenience only;
        // abstract simplices are identified  by their set of vertices
        mutable int id {-1};

        decltype(auto) begin() { return vertices_.begin(); }

        decltype(auto) end() { return vertices_.end(); }

        decltype(auto) begin() const { return vertices_.begin(); }

        decltype(auto) end() const { return vertices_.end(); }

        decltype(auto) cbegin() const { return vertices_.cbegin(); }

        decltype(auto) cend() const { return vertices_.cend(); }

        int dim() const { return vertices_.size() - 1; }

        void push_back(int v);

        AbstractSimplex() { }

        AbstractSimplex(std::vector<int> vertices, bool sort = true);

        template<class Iter>
        AbstractSimplex(Iter beg_iter, Iter end_iter, bool sort = true)
                :
                vertices_(beg_iter, end_iter)
        {
            if (sort)
                std::sort(vertices_.begin(), end());
        }

        std::vector<AbstractSimplex> facets() const;

        friend std::ostream& operator<<(std::ostream& os, const AbstractSimplex& s);

        // compare by vertices_ only
        friend bool operator==(const AbstractSimplex& s1, const AbstractSimplex& s2);

        friend bool operator<(const AbstractSimplex&, const AbstractSimplex&);
    };

    std::ostream& operator<<(std::ostream& os, const AbstractSimplex& s);

    class Simplex {
    private:
        Index id_;
        Point pos_;
        int dim_;
        // in our format we use facet indices,
        // this is the fastest representation for homology
        // Rivet format fills vertices_ vector
        // Simplex alone cannot convert from one representation to the other,
        // conversion routines are in Bifiltration
        Column facet_indices_;
        Column vertices_;
        Real v {0.0}; // used when constructed a filtration for a slice
    public:
        Simplex(Index _id, std::string s, BifiltrationFormat input_format);

        Simplex(Index _id, Point birth, int _dim, const Column& _bdry);

        void init_rivet(std::string s);

        void init_rene(std::string s);

        Index id() const { return id_; }

        int dim() const { return dim_; }

        Column boundary() const { return facet_indices_; }

        Real value() const { return v; }

        // assumes 1-criticality
        Point position() const { return pos_; }

        void set_position(const Point& new_pos) { pos_ = new_pos; }

        void scale(Real lambda)
        {
            pos_.x *= lambda;
            pos_.y *= lambda;
        }

        void translate(Real a);

        void set_value(Real new_val) { v = new_val; }

        friend std::ostream& operator<<(std::ostream& os, const Simplex& s);

        friend Bifiltration;
    };

    std::ostream& operator<<(std::ostream& os, const Simplex& s);

}
#endif //MATCHING_DISTANCE_SIMPLEX_H