face_tri3.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2014 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
{


// Forward declarations

// ------------------------------------------------------------
// Tri3 class definition
class Tri3 : public Tri
{
public:

  explicit
  Tri3 (Elem* p=NULL) :
    Tri(Tri3::n_nodes(), p, _nodelinks_data) {}

  ElemType type () const { return TRI3; }

  unsigned int n_sub_elem() const { return 1; }

  virtual bool is_vertex(const unsigned int i) const;

  virtual bool is_edge(const unsigned int i) const;

  virtual bool is_face(const unsigned int i) const;

  /*
   * @returns true iff the specified (local) node number is on the
   * specified side
   */
  virtual bool is_node_on_side(const unsigned int n,
                               const unsigned int s) const;

  /*
   * @returns true iff the specified (local) node number is on the
   * specified edge (== is_node_on_side in 2D)
   */
  virtual bool is_node_on_edge(const unsigned int n,
                               const unsigned int e) const
  { return this->is_node_on_side(n,e); }

  /*
   * @returns true iff the element map is definitely affine within
   * numerical tolerances
   */
  virtual bool has_affine_map () const { return true; }

  virtual bool is_linear () const { return true; }

  Order default_order() const { return FIRST; }

  UniquePtr<Elem> build_side (const unsigned int i,
                              bool proxy) const;

  virtual void connectivity(const unsigned int sf,
                            const IOPackage iop,
                            std::vector<dof_id_type>& conn) const;

  static const unsigned int side_nodes_map[3][2];


  virtual Real volume () const;

  std::pair<Real, Real> min_and_max_angle() const;

protected:

  Node* _nodelinks_data[3];



#ifdef LIBMESH_ENABLE_AMR

  float embedding_matrix (const unsigned int i,
                          const unsigned int j,
                          const unsigned int k) const
  { return _embedding_matrix[i][j][k]; }

  static const float _embedding_matrix[4][3][3];

#endif

};


} // namespace libMesh

#endif // LIBMESH_FACE_TRI3_H