simplex_refiner.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2026 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_SIMPLEX_REFINER_H
#define LIBMESH_SIMPLEX_REFINER_H
 
#include "libmesh/libmesh_config.h"
 
// Local Includes
#include "libmesh/elem.h"
#include "libmesh/function_base.h"
 
#include <map>
#include <memory>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
 
namespace libMesh
{
 
// Forward Declarations
class UnstructuredMesh;
class Node;
 
class SimplexRefiner
{
public:
  explicit
  SimplexRefiner(UnstructuredMesh & mesh);
 
  bool refine_elements ();
 
  virtual void set_desired_volume_function (FunctionBase<Real> * desired);
 
  virtual FunctionBase<Real> * get_desired_volume_function ();
 
  Real & desired_volume() {return _desired_volume;}
 
protected:
 
  std::size_t refine_via_edges();
 
  bool should_refine_elem(Elem & elem);
 
  std::size_t refine_via_edges(Elem & elem,
                               dof_id_type coarse_id);
 
private:
 
  UnstructuredMesh & _mesh;
 
  Real _desired_volume;
 
  std::unique_ptr<FunctionBase<Real>> _desired_volume_func;
 
  std::map<std::pair<Node *, Node *>, Node *> new_nodes;
 
  std::vector<std::unique_ptr<Elem>> new_elements;
 
  std::unordered_map
    <processor_id_type,
     std::vector<std::pair<dof_id_type, dof_id_type>>>
    edge_queries;
 
  // All the "refine first and second to get third" that was
  // done to this edge, including the processor to assign the new node
  // to.
  typedef
    std::vector<std::tuple<dof_id_type, dof_id_type,
                           dof_id_type, processor_id_type>>
    refinement_datum;
 
  void fill_refinement_datum(std::pair<Node *, Node *> vertices,
                             refinement_datum & vec);
 
  std::unordered_map<dof_id_type, std::unordered_map<Point, Elem *>> added_elements;
 
  std::unordered_map<Elem *, dof_id_type> coarse_parent;
 
  std::unordered_map<processor_id_type, std::unique_ptr<Elem>> proxy_elements;
};
 
 
} // namespace libMesh
 
#endif // ifndef LIBMESH_SIMPLEX_REFINER_H