angel
mercurial changeset:
|
Minimal distance for face elimination. More...
#include <heuristics.hpp>
Public Member Functions | |
minimal_distance_face_t () | |
int | operator() (const vector< line_graph_t::face_t > &fv1, const line_graph_t &lg, vector< line_graph_t::face_t > &fv2) |
Minimal distance for face elimination.
fv1 | Set of faces that can be eliminated |
lg | Line graph |
fv2 | Set of faces with minimal distance (see description) |
In terms of vertex numbers, each face has a representation (i, j, k) (whereby several faces may have the same triplet). Faces where k - i is minimal are returned. The motivation is that for small k-i it is not very probable to re-insert this face later.
Definition at line 1004 of file heuristics.hpp.
Definition at line 1006 of file heuristics.hpp.
int angel::minimal_distance_face_t::operator() | ( | const vector< line_graph_t::face_t > & | fv1, |
const line_graph_t & | lg, | ||
vector< line_graph_t::face_t > & | fv2 | ||
) |
Definition at line 1123 of file heuristics.cpp.
References angel::standard_heuristic_op().