[976] | 1 | #include "robustlib.h" |
---|
| 2 | |
---|
[1254] | 3 | void polyhedron::triangulate(bool should_integrate) |
---|
| 4 | { |
---|
[1271] | 5 | if(should_integrate) |
---|
| 6 | { |
---|
| 7 | ((toprow *)this)->probability = 0.0; |
---|
| 8 | } |
---|
| 9 | |
---|
[1254] | 10 | for(list<polyhedron*>::iterator child_ref = children.begin();child_ref!=children.end();child_ref++) |
---|
[1271] | 11 | { |
---|
[1254] | 12 | for(list<set<vertex*>>::iterator t_ref = (*child_ref)->triangulation.begin();t_ref!=(*child_ref)->triangulation.end();t_ref++) |
---|
| 13 | { |
---|
| 14 | set<vertex*> new_simplex; |
---|
| 15 | new_simplex.insert((*t_ref).begin(),(*t_ref).end()); |
---|
| 16 | |
---|
| 17 | pair<set<vertex*>::iterator,bool> ret_val = new_simplex.insert(*vertices.begin()); |
---|
| 18 | |
---|
| 19 | if(ret_val.second == true) |
---|
| 20 | { |
---|
| 21 | triangulation.push_back(new_simplex); |
---|
| 22 | |
---|
[1271] | 23 | if(should_integrate) |
---|
[1254] | 24 | { |
---|
[1271] | 25 | ((toprow *)this)->probability += ((toprow *)this)->integrate_simplex(new_simplex, 'S'); |
---|
| 26 | } |
---|
| 27 | } |
---|
| 28 | } |
---|
| 29 | } |
---|
| 30 | } |
---|
[1268] | 31 | |
---|
| 32 | |
---|
[1271] | 33 | double toprow::integrate_simplex(set<vertex*> simplex, char c) |
---|
| 34 | { |
---|
| 35 | int condition_order = ((toprow*)this)->condition_order-1; |
---|
[1254] | 36 | |
---|
[1271] | 37 | // cout << "C:" << condition_order << " N:" << my_emlig->number_of_parameters << " C+N:" << condition_order-my_emlig->number_of_parameters << endl; |
---|
| 38 | // pause(0.1); |
---|
[1254] | 39 | |
---|
[1271] | 40 | if(condition_order-my_emlig->number_of_parameters >= 0) |
---|
| 41 | { |
---|
| 42 | emlig* current_emlig; |
---|
[1254] | 43 | |
---|
[1271] | 44 | if(this->my_emlig!=NULL) |
---|
| 45 | { |
---|
| 46 | current_emlig = this->my_emlig; |
---|
| 47 | } |
---|
| 48 | else |
---|
| 49 | { |
---|
| 50 | throw exception("The statistic of the polyhedron you are trying to integrate over doesn't belong to any emlig!"); |
---|
| 51 | } |
---|
[1254] | 52 | |
---|
[1271] | 53 | toprow* as_toprow = (toprow*)this; |
---|
[1254] | 54 | |
---|
[1271] | 55 | vec cur_condition = as_toprow->condition.get(1,as_toprow->condition.size()-1); |
---|
[1254] | 56 | |
---|
[1271] | 57 | vertex* base_vertex = (*simplex.begin()); |
---|
[1254] | 58 | |
---|
[1271] | 59 | int dimension = simplex.size()-1; |
---|
[1254] | 60 | |
---|
[1271] | 61 | mat jacobian(dimension,dimension); |
---|
[1254] | 62 | |
---|
[1271] | 63 | double a_0 = base_vertex->get_coordinates()*cur_condition+as_toprow->condition[0]; |
---|
| 64 | map<double,int> as; |
---|
[1254] | 65 | |
---|
[1271] | 66 | int row_count = 0; |
---|
| 67 | for(set<vertex*>::iterator vert_ref = (++simplex.begin()); vert_ref!=simplex.end();vert_ref++) |
---|
| 68 | { |
---|
| 69 | vec relative_coords = (*vert_ref)->get_coordinates()-base_vertex->get_coordinates(); |
---|
[1268] | 70 | |
---|
[1271] | 71 | // cout << relative_coords << endl; |
---|
[1268] | 72 | |
---|
[1271] | 73 | jacobian.set_row(row_count,relative_coords); |
---|
[1254] | 74 | |
---|
[1271] | 75 | double new_a = relative_coords*cur_condition; |
---|
| 76 | |
---|
| 77 | pair<map<double,int>::iterator,bool> returned = as.insert(pair<double,int>(new_a,1)); |
---|
| 78 | if(returned.second == false) |
---|
| 79 | { |
---|
| 80 | (*returned.first).second++; |
---|
| 81 | } |
---|
| 82 | else |
---|
| 83 | { |
---|
| 84 | cout << "a[" << row_count << "] = " << new_a << endl; |
---|
| 85 | } |
---|
| 86 | //as.ins(as.size(),new_a); |
---|
| 87 | |
---|
| 88 | row_count++; |
---|
| 89 | } |
---|
[1254] | 90 | |
---|
[1271] | 91 | // cout << endl; |
---|
[1269] | 92 | |
---|
[1271] | 93 | double int_value = 0; |
---|
[1268] | 94 | |
---|
[1271] | 95 | // cout << jacobian << endl; |
---|
[1268] | 96 | |
---|
[1271] | 97 | double det_jacobian = det(jacobian); |
---|
| 98 | for(map<double,int>::iterator as_ref = as.begin();as_ref!=as.end();as_ref++) |
---|
| 99 | { |
---|
| 100 | double multiplier = det_jacobian; |
---|
| 101 | if(a_0!=(*as_ref).first) |
---|
| 102 | { |
---|
| 103 | int as1_order = (*as_ref).second; |
---|
[1268] | 104 | |
---|
[1271] | 105 | current_emlig->set_correction_factors(as1_order); |
---|
| 106 | |
---|
| 107 | vector<double> factors; |
---|
| 108 | int number_of_factors = 0; |
---|
| 109 | for(map<double,int>::iterator as2_ref = as.begin();as2_ref!=as.end();as2_ref++) |
---|
| 110 | { |
---|
| 111 | |
---|
| 112 | if(as2_ref!=as_ref) |
---|
| 113 | { |
---|
| 114 | for(int k = 0;k<(*as2_ref).second;k++) |
---|
| 115 | { |
---|
| 116 | factors.push_back((*as_ref).first-(*as2_ref).first); |
---|
[1262] | 117 | } |
---|
[1271] | 118 | |
---|
| 119 | multiplier /= pow((*as_ref).first-(*as2_ref).first,(*as2_ref).second); |
---|
| 120 | number_of_factors += (*as2_ref).second; |
---|
[1254] | 121 | } |
---|
[1271] | 122 | else |
---|
| 123 | { |
---|
| 124 | factors.push_back((*as_ref).first); |
---|
[1254] | 125 | |
---|
[1271] | 126 | multiplier /= (*as_ref).first; |
---|
| 127 | number_of_factors += 1; |
---|
| 128 | } |
---|
| 129 | } |
---|
[1270] | 130 | |
---|
[1271] | 131 | double bracket = fact(condition_order-number_of_factors)/fact(as1_order-1)/pow((*as_ref).first-a_0,condition_order-number_of_factors); |
---|
| 132 | for(int k = 0;k < as1_order-1;k++) |
---|
| 133 | { |
---|
| 134 | double bracket_factor = pow((double)-1,k+1)*fact(condition_order-1-number_of_factors-k)/fact(as1_order-2-k)/pow((*as_ref).first-a_0,condition_order-1-number_of_factors-k); |
---|
| 135 | |
---|
| 136 | for(set<my_ivec>::iterator combi_ref = this->my_emlig->correction_factors[k].begin();combi_ref!=this->my_emlig->correction_factors[k].end();combi_ref++) |
---|
| 137 | { |
---|
| 138 | double bracket_combination = 1; |
---|
| 139 | for(int j = 0;j<(*combi_ref).size();j++) |
---|
| 140 | { |
---|
| 141 | bracket_combination /= factors[(*combi_ref)[j]]; |
---|
| 142 | } |
---|
[1270] | 143 | |
---|
[1271] | 144 | bracket+=bracket_factor*bracket_combination; |
---|
| 145 | } |
---|
| 146 | } |
---|
[1254] | 147 | |
---|
[1271] | 148 | int_value += multiplier*bracket; |
---|
[1254] | 149 | |
---|
[1271] | 150 | } |
---|
| 151 | else |
---|
[1254] | 152 | { |
---|
[1271] | 153 | throw new exception("Should this happen? a_i=a_0 in the formula for integrating over a simplex! I think it can happen with 0 probability(when phi*2*v_0=phi*v_i)"); |
---|
[1254] | 154 | } |
---|
[1271] | 155 | |
---|
| 156 | // cout << c << int_value << endl; |
---|
| 157 | |
---|
| 158 | return int_value; |
---|
[1254] | 159 | } |
---|
[1271] | 160 | |
---|
| 161 | } |
---|
| 162 | else |
---|
| 163 | { |
---|
| 164 | return 0.0; |
---|
| 165 | } |
---|
[1254] | 166 | } |
---|