face_tri.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2025 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner

// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.

// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA



#ifndef LIBMESH_FACE_TRI_H
#define LIBMESH_FACE_TRI_H

// Local includes
#include "libmesh/libmesh_common.h"
#include "libmesh/face.h"

namespace libMesh
{

class Tri : public Face
{
public:

  Tri (const unsigned int nn,
       Elem * p,
       Node ** nodelinkdata) :
    Face(nn, num_sides, p, _elemlinks_data, nodelinkdata)
  {
    // Make sure the interior parent isn't undefined
    if (LIBMESH_DIM > 2)
      this->set_interior_parent(nullptr);
  }

  Tri (Tri &&) = delete;
  Tri (const Tri &) = delete;
  Tri & operator= (const Tri &) = delete;
  Tri & operator= (Tri &&) = delete;
  virtual ~Tri() = default;

  virtual Point master_point (const unsigned int i) const override final
  {
    libmesh_assert_less(i, this->n_nodes());
    return Point(_master_points[i][0],
                 _master_points[i][1],
                 _master_points[i][2]);
  }

  static const int num_sides = 3;
  static const int num_children = 4;

  virtual unsigned int n_nodes() const override { return 3; }

  virtual unsigned int n_sides() const override final { return 3; }

  virtual unsigned int n_vertices() const override final { return 3; }

  virtual unsigned int n_edges() const override final { return 3; }

  virtual unsigned int n_children() const override final { return 4; }

  virtual bool is_child_on_side(const unsigned int c,
                                const unsigned int s) const override final;

  using Elem::key;

  virtual dof_id_type key () const override final;

  virtual dof_id_type key (const unsigned int s) const override;

  virtual dof_id_type low_order_key (const unsigned int s) const override;

  virtual unsigned int local_side_node(unsigned int side,
                                       unsigned int side_node) const override;

  virtual unsigned int local_edge_node(unsigned int edge,
                                       unsigned int edge_node) const override;

  virtual std::unique_ptr<Elem> side_ptr (const unsigned int i) override final;

  virtual void side_ptr (std::unique_ptr<Elem> & elem,
                         const unsigned int i) override final;

  virtual Real quality (const ElemQuality q) const override;

  virtual std::pair<Real, Real> qual_bounds (const ElemQuality q) const override;

  virtual unsigned int n_permutations() const override final { return 3; }

  virtual bool is_flipped() const override final;

  virtual std::vector<unsigned int> edges_adjacent_to_node(const unsigned int n) const override;

  virtual bool on_reference_element(const Point & p,
                                    const Real eps = TOLERANCE) const override final;

protected:

  Elem * _elemlinks_data[4+(LIBMESH_DIM>2)];

  static const Real _master_points[6][3];

  static const unsigned int adjacent_sides_map[/*num_vertices*/3][/*n_adjacent_sides*/2];
};

} // namespace libMesh

#endif // LIBMESH_FACE_TRI_H