bgeot_mesh.h

Go to the documentation of this file.

/* -*- c++ -*- (enables emacs c++ mode) */
/*===========================================================================
 
 Copyright (C) 2006-2020 Yves Renard
 
 This file is a part of GetFEM
 
 GetFEM  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 3 of the License,  or
 (at your option) any later version along with the GCC Runtime Library
 Exception either version 3.1 or (at your option) any later version.
 This program  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 and GCC Runtime Library Exception for more details.
 You  should  have received a copy of the GNU Lesser General Public License
 along  with  this program;  if not, write to the Free Software Foundation,
 Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301, USA.
 
 As a special exception, you  may use  this file  as it is a part of a free
 software  library  without  restriction.  Specifically,  if   other  files
 instantiate  templates  or  use macros or inline functions from this file,
 or  you compile this  file  and  link  it  with other files  to produce an
 executable, this file  does  not  by itself cause the resulting executable
 to be covered  by the GNU Lesser General Public License.  This   exception
 does not  however  invalidate  any  other  reasons why the executable file
 might be covered by the GNU Lesser General Public License.
 
===========================================================================*/
 
/**@file bgeot_mesh.h
   @author  Yves Renard <[email protected]>
   @date February 15, 2006.
   @brief Basic mesh definition
*/
 
#ifndef BGEOT_MESH_H__
#define BGEOT_MESH_H__
 
#include "bgeot_mesh_structure.h"
#include "bgeot_geometric_trans.h"
#include "bgeot_node_tab.h"
 
namespace bgeot {
 
  /** @internal mesh structure + points
   */
  class basic_mesh : public bgeot::mesh_structure {
 
  public :
    
    // typedef basic_mesh_point_comparator pt_comp;
    typedef bgeot::node_tab PT_TAB;
    typedef bgeot::mesh_structure::ind_cv_ct ind_cv_ct;
    typedef bgeot::mesh_structure::ind_set ind_set;
    typedef bgeot::mesh_structure::ind_pt_face_ct ind_pt_face_ct;
    typedef bgeot::mesh_structure::point_ct point_ct;
 
    typedef gmm::tab_ref_index_ref
    <PT_TAB::const_iterator, ind_cv_ct::const_iterator> ref_mesh_pt_ct;
    typedef gmm::tab_ref_index_ref
    <PT_TAB::const_iterator, ind_pt_face_ct::const_iterator>
    ref_mesh_face_pt_ct;
    
    
  protected :
    
    PT_TAB pts;
 
    dal::dynamic_array<bgeot::pgeometric_trans> gtab;
    dal::bit_vector trans_exists;
 
  public :
 
    dim_type dim() const { return pts.dim(); }
 
    /** Return the bgeot::geometric_trans attached to a convex.
        @param ic the convex number.
    */
    bgeot::pgeometric_trans trans_of_convex(size_type ic) const {
      GMM_ASSERT1(trans_exists[ic],
                  "No geometric transformation or nonexisting element");
      return gtab[ic];
    }
 
    const PT_TAB &points() const { return pts; }
 
    /// Return a (pseudo)container of the points of a given convex
    ref_mesh_pt_ct points_of_convex(size_type ic) const {
      const ind_set &rct = ind_points_of_convex(ic);
      return ref_mesh_pt_ct(pts.begin(), rct.begin(), rct.end());
    }
 
    inline void points_of_convex(size_type ic, base_matrix &G) const {
      const ind_set &rct = ind_points_of_convex(ic);
      size_type N = dim(), Np = rct.size();
      G.base_resize(N, Np);
      auto it = G.begin();
      for (size_type i = 0; i < Np; ++i, it += N) {
        const base_node &P = pts[rct[i]];
        std::copy(P.begin(),  P.end(), it);
      }
    }
 
    /** Add the point pt to the mesh and return the index of the
        point.
 
        If the point is within a radius tol from an existing point the
        function does not create a new point, and returns the index of
         the already existing point.
        If tol is negative the check for nearby points is deactivated.
        The same effect can be achieved by setting the deprecated
        argument remove_duplicated_nodes to false.
 
        @param pt holds the point coordinates.
    */
    size_type add_point(const base_node &pt,
                        const scalar_type tol=scalar_type(0),
                        bool remove_duplicated_nodes = true) {
      return pts.add_node(pt, remove_duplicated_nodes ? tol : -1.);
    }
 
    template<class ITER>
    size_type add_convex(bgeot::pgeometric_trans pgt, ITER ipts) {
      bool present;
      size_type i = mesh_structure::add_convex(pgt->structure(), ipts,
                                               &present);
      gtab[i] = pgt; trans_exists[i] = true;
      return i;
    }
 
    size_type add_segment(size_type a, size_type b) { 
      size_type ipt[2]; ipt[0] = a; ipt[1] = b;
      return add_convex(simplex_geotrans(1, 1), &(ipt[0]));
    }
 
    size_type add_triangle(size_type a, size_type b, size_type c) {
      size_type ipt[3]; ipt[0] = a; ipt[1] = b; ipt[2] = c;
      return add_convex(simplex_geotrans(2, 1), &(ipt[0]));
    }
 
    size_type add_tetrahedron(size_type a, size_type b,
                              size_type c, size_type d) {
      size_type ipt[4]; ipt[0] = a; ipt[1] = b; ipt[2] = c; ipt[3] = d;
      return add_convex(simplex_geotrans(3, 1), &(ipt[0]));
    }
  };
 
  typedef basic_mesh *pbasic_mesh;
 
}
 
#endif /* BGEOT_MESH_H__                                         */