20 #include "libmesh/cell_tet.h" 21 #include "libmesh/cell_tet4.h" 22 #include "libmesh/face_tri3.h" 23 #include "libmesh/enum_elem_quality.h" 66 libmesh_assert_less (s, this->
n_sides());
77 libmesh_assert_less (s, this->
n_sides());
87 unsigned int side_node)
const 89 libmesh_assert_less (side, this->
n_sides());
98 unsigned int edge_node)
const 100 libmesh_assert_less (edge, this->
n_edges());
109 libmesh_assert_less (i, this->
n_sides());
111 std::unique_ptr<Elem> face = std::make_unique<Tri3>();
113 for (
auto n : face->node_index_range())
122 const unsigned int i)
124 this->simple_side_ptr<Tet,Tet4>(side, i,
TRI3);
139 #ifdef LIBMESH_ENABLE_AMR 143 const unsigned int s,
144 const unsigned int checked_nodes[][3])
const 147 libmesh_assert_less (s, this->
n_sides());
151 for (
unsigned int i = 0; i != 3; ++i)
166 const unsigned int node_facing_side[4] = {3, 2, 0, 1};
167 const unsigned int n = node_facing_side[s];
172 Real embedding_sum = 0.;
173 for (
unsigned i=0; i<3; ++i)
176 return (
std::abs(embedding_sum) < 1.e-3 );
183 const unsigned int [][3])
const 185 libmesh_not_implemented();
189 #endif //LIBMESH_ENABLE_AMR 205 if (diag_01_23 < diag_02_13 || diag_03_12 < diag_02_13)
207 if (diag_01_23 < diag_03_12)
219 const unsigned int s)
const 221 libmesh_assert_less (e, this->
n_edges());
222 libmesh_assert_less (s, this->
n_sides());
231 libmesh_assert_less (e, this->
n_edges());
257 std::pair<Real, Real> bounds;
286 bounds.second = 1.414;
290 libMesh::out <<
"Warning: Invalid quality measure chosen." << std::endl;
virtual bool is_edge_on_side(const unsigned int e, const unsigned int s) const override final
virtual Real quality(const ElemQuality q) const override
static const unsigned int edge_sides_map[6][2]
This maps each edge to the sides that contain said edge.
virtual unsigned int local_side_node(unsigned int side, unsigned int side_node) const override
virtual dof_id_type key() const
static const unsigned int side_nodes_map[num_sides][nodes_per_side]
This maps the node of the side to element node numbers.
virtual unsigned int n_sides() const override final
Diagonal
This enumeration keeps track of which diagonal is selected during refinement.
virtual unsigned int n_children() const override final
Diagonal _diagonal_selection
The currently-selected diagonal used during refinement.
The libMesh namespace provides an interface to certain functionality in the library.
virtual std::pair< Real, Real > qual_bounds(const ElemQuality q) const override
virtual bool is_flipped() const override final
virtual unsigned int local_edge_node(unsigned int edge, unsigned int edge_node) const override
virtual Real embedding_matrix(const unsigned int child_num, const unsigned int child_node_num, const unsigned int parent_node_num) const =0
ADRealEigenVector< T, D, asd > abs(const ADRealEigenVector< T, D, asd > &)
static const Real _master_points[14][3]
Master element node locations.
T triple_product(const TypeVector< T > &a, const TypeVector< T > &b, const TypeVector< T > &c)
static const int nodes_per_side
virtual dof_id_type low_order_key(const unsigned int s) const override
virtual std::unique_ptr< Elem > side_ptr(const unsigned int i) override final
virtual unsigned int n_edges() const override final
ElemQuality
Defines an enum for element quality metrics.
DIE A HORRIBLE DEATH HERE typedef LIBMESH_DEFAULT_SCALAR_TYPE Real
const Node * node_ptr(const unsigned int i) const
virtual Real quality(const ElemQuality q) const
void select_diagonal(const Diagonal diag) const
Allows the user to select the diagonal for the refinement.
virtual std::vector< unsigned int > sides_on_edge(const unsigned int e) const override final
void choose_diagonal() const
Derived classes use this function to select an initial diagonal during refinement.
static const unsigned int edge_nodes_map[num_edges][nodes_per_edge]
This maps the node of the edge to element node numbers.
static dof_id_type compute_key(dof_id_type n0)
bool is_child_on_side_helper(const unsigned int c, const unsigned int s, const unsigned int checked_nodes[][3]) const
Called by descendant classes with appropriate data to determine if child c is on side s...
dof_id_type node_id(const unsigned int i) const
const Point & point(const unsigned int i) const
static const int nodes_per_edge