angel::minimal_distance_face_t Class Reference

Minimal distance for face elimination. More...

#include <heuristics.hpp>

Inheritance diagram for angel::minimal_distance_face_t:

[legend]

Collaboration diagram for angel::minimal_distance_face_t:

[legend]

List of all members.

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)

---

Detailed Description

Minimal distance for face elimination.

Parameters:

	fv1	Set of faces that can be eliminated
	lg	Line graph
	fv2	Set of faces with minimal distance (see description)

Returns:

Size of fv2

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 996 of file heuristics.hpp.

---

Constructor & Destructor Documentation

angel::minimal_distance_face_t::minimal_distance_face_t

(

)

[inline]

Definition at line 998 of file heuristics.hpp.

---

Member Function Documentation

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 1115 of file heuristics.cpp.

References angel::standard_heuristic_op().

Here is the call graph for this function:

---

The documentation for this class was generated from the following files:

• angel/include/heuristics.hpp
• angel/src/heuristics.cpp

---