224 lines
7.5 KiB
C++
224 lines
7.5 KiB
C++
#ifndef slic3r_Polygon_hpp_
|
|
#define slic3r_Polygon_hpp_
|
|
|
|
#include "libslic3r.h"
|
|
#include <vector>
|
|
#include <string>
|
|
#include "Line.hpp"
|
|
#include "MultiPoint.hpp"
|
|
#include "Polyline.hpp"
|
|
|
|
namespace Slic3r {
|
|
|
|
class Polygon;
|
|
typedef std::vector<Polygon> Polygons;
|
|
|
|
class Polygon : public MultiPoint {
|
|
public:
|
|
operator Polygons() const;
|
|
operator Polyline() const;
|
|
Point& operator[](Points::size_type idx);
|
|
const Point& operator[](Points::size_type idx) const;
|
|
|
|
Polygon() {};
|
|
explicit Polygon(const Points &points): MultiPoint(points) {};
|
|
Point last_point() const;
|
|
virtual Lines lines() const;
|
|
Polyline split_at_vertex(const Point &point) const;
|
|
// Split a closed polygon into an open polyline, with the split point duplicated at both ends.
|
|
Polyline split_at_index(int index) const;
|
|
// Split a closed polygon into an open polyline, with the split point duplicated at both ends.
|
|
Polyline split_at_first_point() const;
|
|
Points equally_spaced_points(double distance) const;
|
|
double area() const;
|
|
bool is_counter_clockwise() const;
|
|
bool is_clockwise() const;
|
|
bool make_counter_clockwise();
|
|
bool make_clockwise();
|
|
bool is_valid() const;
|
|
// Does an unoriented polygon contain a point?
|
|
// Tested by counting intersections along a horizontal line.
|
|
bool contains(const Point &point) const;
|
|
Polygons simplify(double tolerance) const;
|
|
void simplify(double tolerance, Polygons &polygons) const;
|
|
void triangulate_convex(Polygons* polygons) const;
|
|
Point centroid() const;
|
|
std::string wkt() const;
|
|
Points concave_points(double angle = PI) const;
|
|
Points convex_points(double angle = PI) const;
|
|
};
|
|
|
|
extern BoundingBox get_extents(const Polygon &poly);
|
|
extern BoundingBox get_extents(const Polygons &polygons);
|
|
extern BoundingBox get_extents_rotated(const Polygon &poly, double angle);
|
|
extern BoundingBox get_extents_rotated(const Polygons &polygons, double angle);
|
|
extern std::vector<BoundingBox> get_extents_vector(const Polygons &polygons);
|
|
|
|
// Remove sticks (tentacles with zero area) from the polygon.
|
|
extern bool remove_sticks(Polygon &poly);
|
|
extern bool remove_sticks(Polygons &polys);
|
|
|
|
// Remove polygons with less than 3 edges.
|
|
extern bool remove_degenerate(Polygons &polys);
|
|
extern bool remove_small(Polygons &polys, double min_area);
|
|
|
|
// Append a vector of polygons at the end of another vector of polygons.
|
|
inline void polygons_append(Polygons &dst, const Polygons &src) { dst.insert(dst.end(), src.begin(), src.end()); }
|
|
#if SLIC3R_CPPVER >= 11
|
|
inline void polygons_append(Polygons &dst, Polygons &&src)
|
|
{
|
|
if (dst.empty())
|
|
dst = std::move(src);
|
|
else
|
|
std::move(std::begin(src), std::end(src), std::back_inserter(dst));
|
|
}
|
|
#endif
|
|
|
|
inline void polygons_rotate(Polygons &polys, double angle)
|
|
{
|
|
for (Polygons::iterator p = polys.begin(); p != polys.end(); ++p)
|
|
p->rotate(angle);
|
|
}
|
|
|
|
inline Lines to_lines(const Polygon &poly)
|
|
{
|
|
Lines lines;
|
|
lines.reserve(poly.points.size());
|
|
for (Points::const_iterator it = poly.points.begin(); it != poly.points.end()-1; ++it)
|
|
lines.push_back(Line(*it, *(it + 1)));
|
|
lines.push_back(Line(poly.points.back(), poly.points.front()));
|
|
return lines;
|
|
}
|
|
|
|
inline Lines to_lines(const Polygons &polys)
|
|
{
|
|
size_t n_lines = 0;
|
|
for (size_t i = 0; i < polys.size(); ++ i)
|
|
n_lines += polys[i].points.size();
|
|
Lines lines;
|
|
lines.reserve(n_lines);
|
|
for (size_t i = 0; i < polys.size(); ++ i) {
|
|
const Polygon &poly = polys[i];
|
|
for (Points::const_iterator it = poly.points.begin(); it != poly.points.end()-1; ++it)
|
|
lines.push_back(Line(*it, *(it + 1)));
|
|
lines.push_back(Line(poly.points.back(), poly.points.front()));
|
|
}
|
|
return lines;
|
|
}
|
|
|
|
inline Polylines to_polylines(const Polygons &polys)
|
|
{
|
|
Polylines polylines;
|
|
polylines.assign(polys.size(), Polyline());
|
|
size_t idx = 0;
|
|
for (Polygons::const_iterator it = polys.begin(); it != polys.end(); ++ it) {
|
|
Polyline &pl = polylines[idx ++];
|
|
pl.points = it->points;
|
|
pl.points.push_back(it->points.front());
|
|
}
|
|
assert(idx == polylines.size());
|
|
return polylines;
|
|
}
|
|
|
|
#if SLIC3R_CPPVER >= 11
|
|
inline Polylines to_polylines(Polygons &&polys)
|
|
{
|
|
Polylines polylines;
|
|
polylines.assign(polys.size(), Polyline());
|
|
size_t idx = 0;
|
|
for (Polygons::const_iterator it = polys.begin(); it != polys.end(); ++ it) {
|
|
Polyline &pl = polylines[idx ++];
|
|
pl.points = std::move(it->points);
|
|
pl.points.push_back(it->points.front());
|
|
}
|
|
assert(idx == polylines.size());
|
|
return polylines;
|
|
}
|
|
#endif
|
|
|
|
} // Slic3r
|
|
|
|
// start Boost
|
|
#include <boost/polygon/polygon.hpp>
|
|
namespace boost { namespace polygon {
|
|
template <>
|
|
struct geometry_concept<Slic3r::Polygon>{ typedef polygon_concept type; };
|
|
|
|
template <>
|
|
struct polygon_traits<Slic3r::Polygon> {
|
|
typedef coord_t coordinate_type;
|
|
typedef Slic3r::Points::const_iterator iterator_type;
|
|
typedef Slic3r::Point point_type;
|
|
|
|
// Get the begin iterator
|
|
static inline iterator_type begin_points(const Slic3r::Polygon& t) {
|
|
return t.points.begin();
|
|
}
|
|
|
|
// Get the end iterator
|
|
static inline iterator_type end_points(const Slic3r::Polygon& t) {
|
|
return t.points.end();
|
|
}
|
|
|
|
// Get the number of sides of the polygon
|
|
static inline std::size_t size(const Slic3r::Polygon& t) {
|
|
return t.points.size();
|
|
}
|
|
|
|
// Get the winding direction of the polygon
|
|
static inline winding_direction winding(const Slic3r::Polygon& t) {
|
|
return unknown_winding;
|
|
}
|
|
};
|
|
|
|
template <>
|
|
struct polygon_mutable_traits<Slic3r::Polygon> {
|
|
// expects stl style iterators
|
|
template <typename iT>
|
|
static inline Slic3r::Polygon& set_points(Slic3r::Polygon& polygon, iT input_begin, iT input_end) {
|
|
polygon.points.clear();
|
|
while (input_begin != input_end) {
|
|
polygon.points.push_back(Point());
|
|
boost::polygon::assign(polygon.points.back(), *input_begin);
|
|
++input_begin;
|
|
}
|
|
// skip last point since Boost will set last point = first point
|
|
polygon.points.pop_back();
|
|
return polygon;
|
|
}
|
|
};
|
|
|
|
template <>
|
|
struct geometry_concept<Slic3r::Polygons> { typedef polygon_set_concept type; };
|
|
|
|
//next we map to the concept through traits
|
|
template <>
|
|
struct polygon_set_traits<Slic3r::Polygons> {
|
|
typedef coord_t coordinate_type;
|
|
typedef Slic3r::Polygons::const_iterator iterator_type;
|
|
typedef Slic3r::Polygons operator_arg_type;
|
|
|
|
static inline iterator_type begin(const Slic3r::Polygons& polygon_set) {
|
|
return polygon_set.begin();
|
|
}
|
|
|
|
static inline iterator_type end(const Slic3r::Polygons& polygon_set) {
|
|
return polygon_set.end();
|
|
}
|
|
|
|
//don't worry about these, just return false from them
|
|
static inline bool clean(const Slic3r::Polygons& polygon_set) { return false; }
|
|
static inline bool sorted(const Slic3r::Polygons& polygon_set) { return false; }
|
|
};
|
|
|
|
template <>
|
|
struct polygon_set_mutable_traits<Slic3r::Polygons> {
|
|
template <typename input_iterator_type>
|
|
static inline void set(Slic3r::Polygons& polygons, input_iterator_type input_begin, input_iterator_type input_end) {
|
|
polygons.assign(input_begin, input_end);
|
|
}
|
|
};
|
|
} }
|
|
// end Boost
|
|
|
|
#endif
|