face_inf_quad.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_INF_QUAD_H
#define LIBMESH_FACE_INF_QUAD_H

#include "libmesh/libmesh_config.h"

#ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS

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

// C++ includes

namespace libMesh
{


// Forward declarations



class InfQuad : public Elem
{
public:

  explicit
  InfQuad (const unsigned int nn,
           Elem* p,
           Node** nodelinkdata) :
    Elem(nn, InfQuad::n_sides(), p, _elemlinks_data, nodelinkdata) {}

  unsigned int dim() const { return 2; }

  //   /**
  //    * @returns 2 for the base, 1 otherwise
  //    */
  //   unsigned int n_children_per_side(const unsigned int s) const;

  unsigned int n_sides() const { return 3; }

  unsigned int n_vertices() const { return 4; }

  unsigned int n_edges() const { return 3; }

  unsigned int n_faces() const { return 0; }

  unsigned int n_children() const { return 2; }

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

  dof_id_type key (const unsigned int s) const;

  UniquePtr<Elem> side (const unsigned int i) const;

  UniquePtr<Elem> build_edge (const unsigned int i) const
  { return build_side(i); }

  /*
   * is_edge_on_side is trivial in 2D
   */
  virtual bool is_edge_on_side(const unsigned int e,
                               const unsigned int s) const
  { return (e == s); }

  Real quality (const ElemQuality q) const;

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

  bool infinite () const { return true; }

  Point origin () const;


protected:

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



// ------------------------------------------------------------
// InfQuad class member functions
// inline
// unsigned int InfQuad::n_children_per_side(const unsigned int s) const
// {
//   libmesh_assert_less (s, this->n_sides());

//   switch (s)
//   {
//     case 0:
//       // every infinite face has 2 children in the base edge
//       return 2;

//     default:
//       // on infinite edges only 1 child
//       return 1;
//   }
// }



inline
Point InfQuad::origin () const
{
  return ( this->point(0)*2 - this->point(this->n_vertices()/2) );
}


} // namespace libMesh


#endif // ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS

#endif // LIBMESH_FACE_INF_QUAD_H