EBGeometry_Triangle2D.hpp

Go to the documentation of this file.

/* EBGeometry
 * Copyright © 2024 Robert Marskar
 * Please refer to Copyright.txt and LICENSE in the EBGeometry root directory.
 */
#ifndef EBGeometry_Triangle2D
#define EBGeometry_Triangle2D
 
// Std includes
#include <array>
 
// Our includes
#include "EBGeometry_Vec.hpp"
 
namespace EBGeometry {
  template <class T>
  class Triangle2D
  {
  public:
    using Vec2 = Vec2T<T>;
 
    using Vec3 = Vec3T<T>;
 
    enum class InsideOutsideAlgorithm // NOLINT
    {
      SubtendedAngle,
      CrossingNumber,
      WindingNumber
    };
 
    Triangle2D() noexcept = default;
 
    Triangle2D(const Vec3& a_normal, const std::array<Vec3, 3>& a_vertices) noexcept;
 
    Triangle2D(const Triangle2D& a_triangle2D) noexcept = default;
 
    Triangle2D(Triangle2D&& a_triangle2D) noexcept = default;
 
    ~Triangle2D() noexcept = default;
 
    Triangle2D&
    operator=(const Triangle2D& a_triangle2D) noexcept = default;
 
    Triangle2D&
    operator=(Triangle2D&& a_triangle2D) noexcept = default;
 
    void
    define(const Vec3& a_normal, const std::array<Vec3, 3>& a_vertices) noexcept;
 
    bool
    isPointInside(const Vec3& a_point, InsideOutsideAlgorithm a_algorithm) const noexcept;
 
    bool
    isPointInsideWindingNumber(const Vec3& a_point) const noexcept;
 
    bool
    isPointInsideCrossingNumber(const Vec3& a_point) const noexcept;
 
    bool
    isPointInsideSubtend(const Vec3& a_point) const noexcept;
 
  private:
    int m_xDir = -1;
 
    int m_yDir = -1;
 
    std::array<Vec2, 2> m_vertices{Vec2::max(), Vec2::max()};
 
    Vec2
    projectPoint(const Vec3& a_point) const noexcept;
 
    int
    computeWindingNumber(const Vec2& a_point) const noexcept;
 
    int
    computeCrossingNumber(const Vec2& a_point) const noexcept;
 
    T
    computeSubtendedAngle(const Vec2& a_point) const noexcept;
  };
} // namespace EBGeometry
 
#include "EBGeometry_Triangle2DImplem.hpp" // NOLINT
 
#endif