| 44 | |
| 45 | template<typename T> |
| 46 | void compute_min_angles(const WireNetwork& network, MatrixFr& values, |
| 47 | T& angle) { |
| 48 | const size_t num_vertices = network.get_num_vertices(); |
| 49 | |
| 50 | // By default, min angle is the max angle possible: 180 degrees. |
| 51 | values = MatrixFr::Ones(num_vertices, 1) * M_PI; |
| 52 | const MatrixFr& vertices = network.get_vertices(); |
| 53 | for (size_t i=0; i<num_vertices; i++) { |
| 54 | const VectorF& v = vertices.row(i); |
| 55 | VectorI neighbors = network.get_vertex_neighbors(i); |
| 56 | |
| 57 | const size_t valance = neighbors.size(); |
| 58 | for (size_t j=0; j<valance; j++) { |
| 59 | VectorF ej = vertices.row(neighbors[j]) - v.transpose(); |
| 60 | for (size_t k=j+1; k<valance; k++) { |
| 61 | VectorF ek = vertices.row(neighbors[k]) - v.transpose(); |
| 62 | values.coeffRef(i,0) = |
| 63 | std::min(values.coeffRef(i,0), angle(ej, ek)); |
| 64 | } |
| 65 | } |
| 66 | } |
| 67 | } |
| 68 | } |
| 69 | |
| 70 | using namespace WireVertexMinAngleAttributeHelper; |
no test coverage detected