TriangleManifold.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 "MooseTypes.h"
#include "SurfaceSide.h"
 
#include "libmesh/bounding_box.h"
#include "libmesh/mesh_base.h"
#include "libmesh/point_locator_base.h"
 
#include <iosfwd>
#include <memory>
#include <cstdint>
#include <string>
#include <unordered_map>
#include <vector>
 
class TriangleManifold
{
public:
  TriangleManifold(MeshBase & mesh, const Real surface_tolerance);
 
  bool contains(const Point & point) const;
 
  SurfaceGeometry::SurfaceSide sideness(const Point & point) const;
 
  const libMesh::BoundingBox & boundingBox() const { return _bounding_box; };
 
  std::size_t numTriangles() const { return _mesh.n_active_elem(); }
 
private:
  enum class RayIntersection
  {
    Miss,
    Hit,
    Ambiguous
  };
 
  void finalize();
 
  void buildCandidateGrid();
 
  bool pointInsideBoundingBox(const Point & point) const;
 
  bool pointOnSurface(const Point & point) const;
 
  RayIntersection rayIntersectsTriangle(const Point & point, const libMesh::Elem & tri) const;
 
  bool containsBySolidAngle(const Point & point) const;
 
  SurfaceGeometry::SurfaceSide classifyByParity(const Point & point) const;
 
  std::vector<dof_id_type> rayCandidates(const Point & point) const;
 
  std::size_t _num_y_cells = 1;
 
  std::size_t _num_z_cells = 1;
 
  Real _y_min = 0.0;
 
  Real _z_min = 0.0;
 
  Real _y_cell_size = 1.0;
 
  Real _z_cell_size = 1.0;
 
  std::unordered_map<std::uint64_t, std::vector<dof_id_type>> _ray_grid;
 
  MeshBase & _mesh;
 
  const Real _surface_tolerance;
 
  const libMesh::BoundingBox _bounding_box;
 
  const std::unique_ptr<libMesh::PointLocatorBase> _point_locator;
};