15 #ifndef RECOTOOL_POLYGON2D_H 16 #define RECOTOOL_POLYGON2D_H 41 unsigned int Size()
const {
return vertices.size(); }
42 const std::pair<float, float>&
Point(
unsigned int p)
const;
43 std::pair<float, float>
Project(
const std::pair<float, float>&,
float)
const;
49 bool PointInside(
const std::pair<float, float>& point)
const;
std::pair< float, float > Project(const std::pair< float, float > &, float) const
bool Contained(const Polygon2D &poly2) const
const std::pair< float, float > & Point(unsigned int p) const
unsigned int Size() const
Create Intersection Polygon.
std::vector< std::pair< float, float > > vertices
auto vector(Vector const &v)
Returns a manipulator which will print the specified array.
bool PolyOverlapSegments(const Polygon2D &poly2) const
bool Overlap(float slope, const Polygon2D &poly2, const std::pair< float, float > &origin) const
Polygon2D(const std::vector< std::pair< float, float >> &points)
bool PointInside(const std::pair< float, float > &point) const
bool PolyOverlap(const Polygon2D &poly2) const
void UntanglePolygon()
check if poly2 is inside poly1
constexpr Point origin()
Returns a origin position with a point of the specified type.