Home
Publications
Presentations
Support
Download
Examples
Developers
Class Docs
Namespaces
Classes
Files
Mailing Lists
Gallery
Wiki

cell_tet4.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2012 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_CELL_TET4_H
#define LIBMESH_CELL_TET4_H

// Local includes
#include "libmesh/cell_tet.h"

// C++ includes
#include <cstddef>

namespace libMesh
{




// ------------------------------------------------------------
// Tet4 class definition
class Tet4 : public Tet
{
public:

  explicit
  Tet4  (Elem* p=NULL);

  ElemType type () const { return TET4; }

  unsigned int n_nodes() const { return 4; }

  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
   */
  virtual bool is_node_on_edge(const unsigned int n,
                               const unsigned int e) const;

  /*
   * @returns true iff the specified child is on the
   * specified side
   */
  virtual bool is_child_on_side(const unsigned int c,
                                const unsigned int s) const;

  /*
   * @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; }

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

  AutoPtr<Elem> build_edge (const unsigned int i) const;

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

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

  static const unsigned int edge_nodes_map[6][2];

  virtual Real volume () const;

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

protected:

  Node* _nodelinks_data[4];



#ifdef LIBMESH_ENABLE_AMR

  float embedding_matrix (const unsigned int i,
                          const unsigned int j,
                          const unsigned int k) const;

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

// public:
//
//  /**
//   * Allows the user to reselect the diagonal after refinement.  This
//   * function may only be called directly after the element is refined
//   * for the first time (and before the \p EquationSystems::reinit()
//   * is called).  It will destroy and re-create the children if
//   * necessary.
//   */
//  void reselect_diagonal (const Diagonal diag);
//
//  /**
//   * Reselects the diagonal after refinement to be the optimal one.
//   * This makes sense if the user has moved some grid points, so that
//   * the former optimal choice is no longer optimal.  Also, the user
//   * may exclude one diagonal from this selection by giving it as
//   * argument.  In this case, the more optimal one of the remaining
//   * two diagonals is chosen.
//   */
//  void reselect_optimal_diagonal (const Diagonal exclude_this=INVALID_DIAG);

#endif

};



// ------------------------------------------------------------
// Tet4 class member functions
inline
Tet4::Tet4(Elem* p) :
  Tet(Tet4::n_nodes(), p, _nodelinks_data)
{
}

} // namespace libMesh


#endif // LIBMESH_CELL_TET4_H

---

Site Created By: libMesh Developers
Last modified: February 05 2013 19:54:45 UTC

Hosted By: