MultiAppGeneralFieldNearestLocationTransfer.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

#include "MultiAppGeneralFieldTransfer.h"
#include "KDTree.h"
#include "SolutionInvalidInterface.h"

class MultiAppGeneralFieldNearestLocationTransfer : public MultiAppGeneralFieldTransfer

{
public:
  static InputParameters validParams();

  MultiAppGeneralFieldNearestLocationTransfer(const InputParameters & parameters);

  void initialSetup() override;

  // Use solution invalid output for these warnings
  usingCombinedWarningSolutionWarnings;

protected:
  virtual void prepareEvaluationOfInterpValues(const unsigned int var_index) override;

  virtual void
  evaluateInterpValues(const std::vector<std::pair<Point, unsigned int>> & incoming_points,
                       std::vector<std::pair<Real, Real>> & outgoing_vals) override;

  using MultiAppGeneralFieldTransfer::inBlocks;
  bool inBlocks(const std::set<SubdomainID> & blocks,
                const MooseMesh & mesh,
                const Elem * elem) const override;

private:
  bool usesMooseAppCoordTransform() const override { return true; }
  /*
   * Build KD-Trees for each local app
   * @param var_index the index of the variable being transferred
   * @details fills _local_kdtrees, _local_points and _local_values
   *          Indexing is: local apps (outer-indexing) OR positions (if using nearest_positions),
   *          local nodes (inner-indexing)
   */
  void buildKDTrees(const unsigned int var_index);

  /*
   * Evaluate interpolation values for incoming points
   * @param incoming_points all the points at which we need values
   * @param outgoing_vals vector containing the values and distances from point to nearest node
   */
  void evaluateInterpValuesNearestNode(
      const std::vector<std::pair<Point, unsigned int>> & incoming_points,
      std::vector<std::pair<Real, Real>> & outgoing_vals);

  void computeNumSources();

  unsigned int getAppIndex(unsigned int kdtree_index, unsigned int app_index) const;

  unsigned int getNumAppsPerTree() const;

  unsigned int getNumDivisions() const;

  Point getPointInLocalSourceFrame(unsigned int i_from, const Point & pt) const;

  bool checkRestrictionsForSource(const Point & pt,
                                  const unsigned int valid_mesh_div,
                                  const unsigned int i_from) const;

  std::vector<std::shared_ptr<KDTree>> _local_kdtrees;

  std::vector<std::vector<std::shared_ptr<KDTree>>> _local_positions_kdtrees;

  std::vector<std::vector<Point>> _local_points;

  std::vector<std::vector<Real>> _local_values;

  unsigned int _num_nearest_points;

  const bool _group_subapps;

  std::vector<bool> _source_is_nodes;

  std::vector<bool> _use_zero_dof_for_value;

  unsigned int _num_sources;
};