2013-07-06 14:33:49 +00:00
|
|
|
#ifndef slic3r_ExPolygon_hpp_
|
|
|
|
#define slic3r_ExPolygon_hpp_
|
|
|
|
|
2015-12-07 23:39:54 +00:00
|
|
|
#include "libslic3r.h"
|
2013-07-14 13:53:53 +00:00
|
|
|
#include "Polygon.hpp"
|
2014-05-13 18:06:01 +00:00
|
|
|
#include "Polyline.hpp"
|
2013-07-15 18:31:43 +00:00
|
|
|
#include <vector>
|
2013-07-06 14:33:49 +00:00
|
|
|
|
2013-07-07 20:36:14 +00:00
|
|
|
namespace Slic3r {
|
|
|
|
|
2013-11-22 01:16:10 +00:00
|
|
|
class ExPolygon;
|
|
|
|
typedef std::vector<ExPolygon> ExPolygons;
|
|
|
|
|
2013-07-06 14:33:49 +00:00
|
|
|
class ExPolygon
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
Polygon contour;
|
|
|
|
Polygons holes;
|
2014-01-09 16:26:39 +00:00
|
|
|
operator Points() const;
|
2013-11-21 14:12:06 +00:00
|
|
|
operator Polygons() const;
|
2013-09-13 12:48:40 +00:00
|
|
|
void scale(double factor);
|
|
|
|
void translate(double x, double y);
|
2016-04-10 17:12:32 +00:00
|
|
|
void rotate(double angle);
|
2014-04-24 11:43:24 +00:00
|
|
|
void rotate(double angle, const Point ¢er);
|
2013-09-13 12:48:40 +00:00
|
|
|
double area() const;
|
|
|
|
bool is_valid() const;
|
2014-11-23 19:14:13 +00:00
|
|
|
bool contains(const Line &line) const;
|
|
|
|
bool contains(const Polyline &polyline) const;
|
|
|
|
bool contains(const Point &point) const;
|
2015-01-06 19:52:36 +00:00
|
|
|
bool contains_b(const Point &point) const;
|
|
|
|
bool has_boundary_point(const Point &point) const;
|
2015-07-06 23:17:31 +00:00
|
|
|
void simplify_p(double tolerance, Polygons* polygons) const;
|
2013-11-22 01:16:10 +00:00
|
|
|
Polygons simplify_p(double tolerance) const;
|
2013-11-21 19:25:24 +00:00
|
|
|
ExPolygons simplify(double tolerance) const;
|
2015-12-21 13:46:35 +00:00
|
|
|
void simplify(double tolerance, ExPolygons* expolygons) const;
|
2016-03-19 14:33:58 +00:00
|
|
|
void medial_axis(double max_width, double min_width, ThickPolylines* polylines) const;
|
2014-03-09 16:46:02 +00:00
|
|
|
void medial_axis(double max_width, double min_width, Polylines* polylines) const;
|
2014-04-24 11:43:24 +00:00
|
|
|
void get_trapezoids(Polygons* polygons) const;
|
|
|
|
void get_trapezoids(Polygons* polygons, double angle) const;
|
2014-04-28 18:14:20 +00:00
|
|
|
void get_trapezoids2(Polygons* polygons) const;
|
|
|
|
void get_trapezoids2(Polygons* polygons, double angle) const;
|
2014-04-24 15:06:16 +00:00
|
|
|
void triangulate(Polygons* polygons) const;
|
2014-05-01 08:37:38 +00:00
|
|
|
void triangulate_pp(Polygons* polygons) const;
|
2014-05-01 10:07:11 +00:00
|
|
|
void triangulate_p2t(Polygons* polygons) const;
|
2015-01-06 19:52:36 +00:00
|
|
|
Lines lines() const;
|
2016-05-20 04:24:05 +00:00
|
|
|
std::string dump_perl() const;
|
2013-07-06 14:33:49 +00:00
|
|
|
};
|
|
|
|
|
2016-04-10 17:12:32 +00:00
|
|
|
inline Polygons to_polygons(const ExPolygons &src)
|
|
|
|
{
|
|
|
|
Polygons polygons;
|
|
|
|
for (ExPolygons::const_iterator it = src.begin(); it != src.end(); ++it) {
|
|
|
|
polygons.push_back(it->contour);
|
|
|
|
for (Polygons::const_iterator ith = it->holes.begin(); ith != it->holes.end(); ++ith) {
|
|
|
|
polygons.push_back(*ith);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return polygons;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if SLIC3R_CPPVER > 11
|
|
|
|
inline Polygons to_polygons(ExPolygons &&src)
|
|
|
|
{
|
|
|
|
Polygons polygons;
|
|
|
|
for (ExPolygons::const_iterator it = src.begin(); it != src.end(); ++it) {
|
|
|
|
polygons.push_back(std::move(it->contour));
|
|
|
|
for (Polygons::const_iterator ith = it->holes.begin(); ith != it->holes.end(); ++ith) {
|
|
|
|
polygons.push_back(std::move(*ith));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return polygons;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2016-09-13 11:30:00 +00:00
|
|
|
extern BoundingBox get_extents(const ExPolygon &expolygon);
|
|
|
|
extern BoundingBox get_extents(const ExPolygons &expolygons);
|
|
|
|
|
|
|
|
} // namespace Slic3r
|
2013-07-07 20:36:14 +00:00
|
|
|
|
2014-04-24 11:43:24 +00:00
|
|
|
// start Boost
|
|
|
|
#include <boost/polygon/polygon.hpp>
|
|
|
|
namespace boost { namespace polygon {
|
|
|
|
template <>
|
|
|
|
struct polygon_traits<ExPolygon> {
|
|
|
|
typedef coord_t coordinate_type;
|
|
|
|
typedef Points::const_iterator iterator_type;
|
|
|
|
typedef Point point_type;
|
|
|
|
|
|
|
|
// Get the begin iterator
|
|
|
|
static inline iterator_type begin_points(const ExPolygon& t) {
|
|
|
|
return t.contour.points.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the end iterator
|
|
|
|
static inline iterator_type end_points(const ExPolygon& t) {
|
|
|
|
return t.contour.points.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the number of sides of the polygon
|
|
|
|
static inline std::size_t size(const ExPolygon& t) {
|
|
|
|
return t.contour.points.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the winding direction of the polygon
|
|
|
|
static inline winding_direction winding(const ExPolygon& t) {
|
|
|
|
return unknown_winding;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_mutable_traits<ExPolygon> {
|
|
|
|
//expects stl style iterators
|
|
|
|
template <typename iT>
|
|
|
|
static inline ExPolygon& set_points(ExPolygon& expolygon, iT input_begin, iT input_end) {
|
|
|
|
expolygon.contour.points.assign(input_begin, input_end);
|
|
|
|
// skip last point since Boost will set last point = first point
|
|
|
|
expolygon.contour.points.pop_back();
|
|
|
|
return expolygon;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct geometry_concept<ExPolygon> { typedef polygon_with_holes_concept type; };
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_with_holes_traits<ExPolygon> {
|
|
|
|
typedef Polygons::const_iterator iterator_holes_type;
|
|
|
|
typedef Polygon hole_type;
|
|
|
|
static inline iterator_holes_type begin_holes(const ExPolygon& t) {
|
|
|
|
return t.holes.begin();
|
|
|
|
}
|
|
|
|
static inline iterator_holes_type end_holes(const ExPolygon& t) {
|
|
|
|
return t.holes.end();
|
|
|
|
}
|
|
|
|
static inline unsigned int size_holes(const ExPolygon& t) {
|
2016-09-26 11:56:24 +00:00
|
|
|
return (int)t.holes.size();
|
2014-04-24 11:43:24 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_with_holes_mutable_traits<ExPolygon> {
|
|
|
|
template <typename iT>
|
|
|
|
static inline ExPolygon& set_holes(ExPolygon& t, iT inputBegin, iT inputEnd) {
|
|
|
|
t.holes.assign(inputBegin, inputEnd);
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
//first we register CPolygonSet as a polygon set
|
|
|
|
template <>
|
|
|
|
struct geometry_concept<ExPolygons> { typedef polygon_set_concept type; };
|
|
|
|
|
|
|
|
//next we map to the concept through traits
|
|
|
|
template <>
|
|
|
|
struct polygon_set_traits<ExPolygons> {
|
|
|
|
typedef coord_t coordinate_type;
|
|
|
|
typedef ExPolygons::const_iterator iterator_type;
|
|
|
|
typedef ExPolygons operator_arg_type;
|
|
|
|
|
|
|
|
static inline iterator_type begin(const ExPolygons& polygon_set) {
|
|
|
|
return polygon_set.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline iterator_type end(const ExPolygons& polygon_set) {
|
|
|
|
return polygon_set.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
//don't worry about these, just return false from them
|
|
|
|
static inline bool clean(const ExPolygons& polygon_set) { return false; }
|
|
|
|
static inline bool sorted(const ExPolygons& polygon_set) { return false; }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_set_mutable_traits<ExPolygons> {
|
|
|
|
template <typename input_iterator_type>
|
|
|
|
static inline void set(ExPolygons& expolygons, input_iterator_type input_begin, input_iterator_type input_end) {
|
|
|
|
expolygons.assign(input_begin, input_end);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
} }
|
|
|
|
// end Boost
|
|
|
|
|
2013-07-06 14:33:49 +00:00
|
|
|
#endif
|