| 113 | } |
| 114 | |
| 115 | void get_min_edge12( double a01, |
| 116 | double a11, |
| 117 | double b1, |
| 118 | double f10, |
| 119 | double f01, |
| 120 | std::array< double, 2 >& p ) |
| 121 | { |
| 122 | const auto h0 = a01 + b1 - f10; |
| 123 | if( h0 >= 0 ) |
| 124 | { |
| 125 | p[1] = 0; |
| 126 | } |
| 127 | else |
| 128 | { |
| 129 | const auto h1 = a11 + b1 - f01; |
| 130 | if( h1 <= 0 ) |
| 131 | { |
| 132 | p[1] = 1; |
| 133 | } |
| 134 | else |
| 135 | { |
| 136 | p[1] = h0 / ( h0 - h1 ); |
| 137 | } |
| 138 | } |
| 139 | p[0] = 1 - p[1]; |
| 140 | } |
| 141 | |
| 142 | void get_min_interior( const std::array< double, 2 >& p0, |
| 143 | double h0, |
no outgoing calls
no test coverage detected