face_inf_quad.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_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"

namespace libMesh
{

class InfQuad : public Elem
{
public:

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

  InfQuad (InfQuad &&) = delete;
  InfQuad (const InfQuad &) = delete;
  InfQuad & operator= (const InfQuad &) = delete;
  InfQuad & operator= (InfQuad &&) = delete;
  virtual ~InfQuad() = 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 = 2;

  virtual unsigned short dim() const override final { return 2; }

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

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

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

  virtual unsigned int n_faces() const override final { return 0; }

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

  virtual bool is_vertex(const unsigned int i) const override final { return (i < 4); }

  virtual bool is_edge(const unsigned int i) const override final { return (i >= 4 && i < 5); }

  virtual bool is_face(const unsigned int i) const override final { return (i >= 5); }

  virtual bool is_mid_infinite_edge_node(const unsigned int i) const
    override final { return (i > 2 && i < 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 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> & side, const unsigned int i) override final;

  virtual std::unique_ptr<Elem> build_edge_ptr (const unsigned int i) override final
  { return build_side_ptr(i); }

  virtual void build_edge_ptr (std::unique_ptr<Elem> & edge, const unsigned int i) override final
  { build_side_ptr(edge, i); }

  // Avoid hiding deprecated version with different signature
  using Elem::build_side_ptr;

  virtual bool is_edge_on_side(const unsigned int e,
                               const unsigned int s) const override final
  { return (e == s); }

  virtual std::vector<unsigned int> sides_on_edge(const unsigned int e) const override final
  { return {e}; }

  virtual Real quality (const ElemQuality q) const override;

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

  virtual bool infinite () const override final { return true; }

  virtual Point origin () const override final
  {
    return ( this->point(0)*2 - this->point(this->n_vertices()/2) );
  }

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

  virtual void permute(unsigned int) override final { libmesh_error(); }

  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*/4][/*max_adjacent_sides*/2];
};

} // namespace libMesh


#endif // ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS

#endif // LIBMESH_FACE_INF_QUAD_H