EBGeometry_Polygon2D.hpp

Go to the documentation of this file.

/* EBGeometry
 * Copyright © 2022 Robert Marskar
 * Please refer to Copyright.txt and LICENSE in the EBGeometry root directory.
 */
#ifndef EBGeometry_Polygon2D
#define EBGeometry_Polygon2D
 
// Std includes
#include <memory>
#include <vector>
 
// Our includes
#include "EBGeometry_Vec.hpp"
#include "EBGeometry_NamespaceHeader.hpp"
 
template <class T>
class Polygon2D
{
public:
  enum class InsideOutsideAlgorithm
  {
    SubtendedAngle,
    CrossingNumber,
    WindingNumber
  };
 
  using Vec2 = Vec2T<T>;
 
  using Vec3 = Vec3T<T>;
 
  Polygon2D() = delete;
 
  Polygon2D(const Vec3& a_normal, const std::vector<Vec3>& a_points);
 
  ~Polygon2D() = default;
 
  inline bool
  isPointInside(const Vec3& a_point, const InsideOutsideAlgorithm a_algorithm) const noexcept;
 
  inline bool
  isPointInsidePolygonWindingNumber(const Vec3& a_point) const noexcept;
 
  inline bool
  isPointInsidePolygonSubtend(const Vec3& a_point) const noexcept;
 
  inline bool
  isPointInsidePolygonCrossingNumber(const Vec3& a_point) const noexcept;
 
private:
  size_t m_xDir;
 
  size_t m_yDir;
 
  std::vector<Vec2> m_points;
 
  inline Vec2
  projectPoint(const Vec3& a_point) const noexcept;
 
  inline void
  define(const Vec3& a_normal, const std::vector<Vec3>& a_points);
 
  inline int
  computeWindingNumber(const Vec2& P) const noexcept;
 
  inline size_t
  computeCrossingNumber(const Vec2& P) const noexcept;
 
  inline T
  computeSubtendedAngle(const Vec2& P) const noexcept;
};
 
#include "EBGeometry_NamespaceFooter.hpp"
 
#include "EBGeometry_Polygon2DImplem.hpp"
 
#endif