12 , m_min_valence(min_valence)
22 const std::vector<Tuple>& top_dimension_tuples_before,
23 const std::vector<Tuple>& top_dimension_tuples_after)
const
25 for (
const Tuple& e : top_dimension_tuples_after) {
30 for (
const Tuple& edge : e_edges) {
43 using namespace simplex;
45 const std::vector<Tuple> vs = faces_single_dimension_tuples(
The Tuple is the basic navigation tool in our mesh data structure.
const Mesh & mesh() const
bool is_greater_min_valence(const Tuple &t) const
bool before(const simplex::Simplex &t) const override
bool after(const std::vector< Tuple > &top_dimension_tuples_before, const std::vector< Tuple > &top_dimension_tuples_after) const override
MinIncidentValenceInvariant(const Mesh &m, int64_t min_valence)
const std::vector< Simplex > & simplex_vector() const
Return const reference to the simplex vector.
static Simplex face(const Mesh &m, const Tuple &t)
static Simplex vertex(const Mesh &m, const Tuple &t)
const Tuple & tuple() const
PrimitiveType primitive_type() const
std::vector< Tuple > faces_single_dimension_tuples(const Mesh &mesh, const Simplex &simplex, const PrimitiveType face_type)