face_tri3.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2019 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_TRI3_H
#define LIBMESH_FACE_TRI3_H
 
 
// Local includes
#include "libmesh/libmesh_common.h"
#include "libmesh/face_tri.h"
 
// C++ includes
#include <cstddef>
 
namespace libMesh
{
 
class Tri3 : public Tri
{
public:
 
  explicit
  Tri3 (Elem * p=nullptr) :
    Tri(Tri3::n_nodes(), p, _nodelinks_data) {}
 
  Tri3 (Tri3 &&) = delete;
  Tri3 (const Tri3 &) = delete;
  Tri3 & operator= (const Tri3 &) = delete;
  Tri3 & operator= (Tri3 &&) = delete;
  virtual ~Tri3() = default;
 
  virtual ElemType type () const override { return TRI3; }
 
  virtual unsigned int n_sub_elem() const override { return 1; }
 
  virtual bool is_vertex(const unsigned int i) const override;
 
  virtual bool is_edge(const unsigned int i) const override;
 
  virtual bool is_face(const unsigned int i) const override;
 
  virtual bool is_node_on_side(const unsigned int n,
                               const unsigned int s) const override;
 
  virtual std::vector<unsigned int> nodes_on_side(const unsigned int s) const override;
 
  virtual bool is_node_on_edge(const unsigned int n,
                               const unsigned int e) const override
  { return this->is_node_on_side(n,e); }
 
  virtual bool has_affine_map () const override { return true; }
 
  virtual bool is_linear () const override { return true; }
 
  virtual Order default_order() const override;
 
  virtual std::unique_ptr<Elem> build_side_ptr (const unsigned int i,
                                                bool proxy=true) override;
 
  virtual void build_side_ptr (std::unique_ptr<Elem> & elem,
                               const unsigned int i) override;
 
  virtual void connectivity(const unsigned int sf,
                            const IOPackage iop,
                            std::vector<dof_id_type> & conn) const override;
 
  static const int num_nodes = 3;
  static const int num_sides = 3;
  static const int num_children = 4;
  static const int nodes_per_side = 2;
 
  static const unsigned int side_nodes_map[num_sides][nodes_per_side];
 
  virtual Real volume () const override;
 
  std::pair<Real, Real> min_and_max_angle() const;
 
  virtual bool contains_point (const Point & p, Real tol) const override;
 
  virtual BoundingBox loose_bounding_box () const override;
 
protected:
 
  Node * _nodelinks_data[num_nodes];
 
 
 
#ifdef LIBMESH_ENABLE_AMR
 
  virtual float embedding_matrix (const unsigned int i,
                                  const unsigned int j,
                                  const unsigned int k) const override
  { return _embedding_matrix[i][j][k]; }
 
  static const float _embedding_matrix[num_children][num_nodes][num_nodes];
 
  LIBMESH_ENABLE_TOPOLOGY_CACHES;
 
#endif // LIBMESH_ENABLE_AMR
 
};
 
} // namespace libMesh
 
#endif // LIBMESH_FACE_TRI3_H