PolycrystalVoronoi.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 "KDTree.h"
#include "PolycrystalUserObjectBase.h"
 
// Forward Declarations
 
class PolycrystalVoronoi : public PolycrystalUserObjectBase
{
public:
  static InputParameters validParams();
 
  PolycrystalVoronoi(const InputParameters & parameters);
 
  virtual void precomputeGrainStructure() override;
  virtual void getGrainsBasedOnPoint(const Point & point,
                                     std::vector<unsigned int> & grains) const override;
  virtual Real getVariableValue(unsigned int op_index, const Point & p) const override;
 
  virtual unsigned int getNumGrains() const override { return _grain_num; }
  virtual std::vector<Point> getGrainCenters() const { return _centerpoints; }
 
  // Build a KD tree
  void buildSearchTree();
 
protected:
  unsigned int _grain_num;
 
  const bool _columnar_3D;
 
  const unsigned int _rand_seed;
  const Real _int_width;
 
  Point _bottom_left;
  Point _top_right;
  Point _range;
 
  std::vector<Point> _centerpoints;
 
  const FileName _file_name;
 
private:
  Real computeDiffuseInterface(const Point & point,
                               const unsigned int & gr_index,
                               const std::vector<unsigned int> & grain_ids) const;
  Point findNormalVector(const Point & point, const Point & p1, const Point & p2) const;
  Point findCenterPoint(const Point & point, const Point & p1, const Point & p2) const;
  Real findLinePoint(const Point & point,
                     const Point & N,
                     const Point & cntr,
                     const unsigned int dim) const;
 
  std::unique_ptr<KDTree> _kd_tree;
  std::vector<dof_id_type> _grain_gtl_ids;
  std::vector<Point> _new_points;
  bool _use_kdtree;
  unsigned int _point_patch_size;
  unsigned int _grain_patch_size;
};