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
|
/*
* Contractor.h
*
* Created on: Sep 25, 2014
* Author: dsalinas
*/
#ifndef EDGE_CONTRACTOR_H_
#define EDGE_CONTRACTOR_H_
#include "gudhi/Skeleton_blocker_contractor.h"
#include "gudhi/Contraction/Edge_profile.h"
#include "gudhi/Contraction/policies/Cost_policy.h"
/**
* Iteratively puts every vertex at the center of its neighbors
*/
template<typename SkBlComplex> class Edge_contractor{
private:
SkBlComplex& complex_;
unsigned num_contractions_;
/**
* @brief return a cost corresponding to the squared length of the edge
*/
template< typename EdgeProfile> class Length_cost : public contraction::Cost_policy<EdgeProfile>{
public:
typedef typename contraction::Cost_policy<EdgeProfile>::Cost_type Cost_type;
typedef typename EdgeProfile::Point Point;
Cost_type operator()(const EdgeProfile& profile, const boost::optional<Point>& placement) const override{
Cost_type res;
if(!placement) return res;
return Geometry_trait::Squared_distance_d()(profile.p0(),profile.p1()); //not working??
}
};
/**
* @brief return a cost corresponding to the squared length of the edge
*/
template< typename EdgeProfile> class Middle_placement : public contraction::Placement_policy<EdgeProfile>{
public:
typedef typename contraction::Placement_policy<EdgeProfile>::Placement_type Placement_type;
typedef typename EdgeProfile::Point Point;
Placement_type operator()(const EdgeProfile& profile) const override{
std::vector<double> mid_coords(profile.p0().dimension(),0);
for (size_t i = 0; i < profile.p0().dimension(); ++i){
mid_coords[i] = (profile.p0()[i] + profile.p1()[i]) / 2.;
}
return Point(profile.p0().dimension(),mid_coords.begin(), mid_coords.end());
}
};
public:
typedef typename SkBlComplex::Vertex_handle Vertex_handle;
typedef typename SkBlComplex::Edge_handle Edge_handle;
/**
* @brief Modify complex to be the expansion of the k-nearest neighbor
* symetric graph.
*/
Edge_contractor(SkBlComplex& complex,unsigned num_contractions):
complex_(complex),num_contractions_(num_contractions)
{
typedef typename contraction::Edge_profile<Complex> Profile;
num_contractions = (std::min)((int)num_contractions,(int)(complex_.num_vertices()-1));
contraction::Skeleton_blocker_contractor<Complex> contractor(
complex_,
new Length_cost<contraction::Edge_profile<Complex>>(),
new Middle_placement<contraction::Edge_profile<Complex>>(),
contraction::make_link_valid_contraction<Profile>(),
contraction::make_remove_popable_blockers_visitor<Profile>()
);
contractor.contract_edges(num_contractions);
}
};
#endif /* EDGE_CONTRACTOR_H_ */
|
