NearestNodeLocator.h

Go to the documentation of this file.

//* This file is part of the MOOSE framework
//* https://mooseframework.inl.gov
//*
//* All rights reserved, see COPYRIGHT for full restrictions
//* https://github.com/idaholab/moose/blob/master/COPYRIGHT
//*
//* Licensed under LGPL 2.1, please see LICENSE for details
//* https://www.gnu.org/licenses/lgpl-2.1.html

#pragma once

// Moose
#include "Restartable.h"
#include "PerfGraphInterface.h"

// Forward declarations
class SubProblem;
class MooseMesh;

class NearestNodeLocator : public Restartable, public PerfGraphInterface
{
public:
  NearestNodeLocator(SubProblem & subproblem,
                     MooseMesh & mesh,
                     BoundaryID boundary1,
                     BoundaryID boundary2);

  ~NearestNodeLocator();

  void findNodes();

  void reinit();

  Real distance(dof_id_type node_id);

  const Node * nearestNode(dof_id_type node_id);

  std::vector<dof_id_type> & secondaryNodes() { return _secondary_nodes; }

  NodeIdRange & secondaryNodeRange() { return *_secondary_node_range; }

  void updatePatch(std::vector<dof_id_type> & secondary_nodes);

  void updateGhostedElems();

  class NearestNodeInfo
  {
  public:
    NearestNodeInfo();

    const Node * _nearest_node;
    Real _distance;
  };

protected:
  SubProblem & _subproblem;

  MooseMesh & _mesh;

  std::unique_ptr<NodeIdRange> _secondary_node_range;

public:
  std::map<dof_id_type, NearestNodeInfo> _nearest_node_info;

  BoundaryID _boundary1;
  BoundaryID _boundary2;

  bool _first;

  // Compute neighborhood nodes around the secondary nodes if iteration update strategy is selected.
  // This flag is required for (at least initial) adaptivity in parallel and is set to true on
  // reinit()
  bool _reinit_iteration;

  std::vector<dof_id_type> _secondary_nodes;

  std::map<dof_id_type, std::vector<dof_id_type>> _neighbor_nodes;

  // The following parameter controls the patch size that is searched for each nearest neighbor
  static const unsigned int _patch_size;

  // Contact patch update strategy
  const Moose::PatchUpdateType _patch_update_strategy;

  // The furthest through the patch that had to be searched for any node last time
  Real _max_patch_percentage;

  // The list of ghosted elements added during a time step for iteration patch update strategy
  std::vector<dof_id_type> _new_ghosted_elems;
};