2013-07-14 13:53:53 +00:00
|
|
|
#ifndef slic3r_Polygon_hpp_
|
|
|
|
#define slic3r_Polygon_hpp_
|
|
|
|
|
2013-07-16 19:04:14 +00:00
|
|
|
#include <myinit.h>
|
2013-07-15 18:31:43 +00:00
|
|
|
#include <vector>
|
2013-07-16 19:04:14 +00:00
|
|
|
#include "Line.hpp"
|
|
|
|
#include "MultiPoint.hpp"
|
2013-07-14 14:09:54 +00:00
|
|
|
#include "Polyline.hpp"
|
2013-07-14 13:53:53 +00:00
|
|
|
|
|
|
|
namespace Slic3r {
|
|
|
|
|
2013-11-22 01:16:10 +00:00
|
|
|
class Polygon;
|
|
|
|
typedef std::vector<Polygon> Polygons;
|
|
|
|
|
2013-07-15 21:28:23 +00:00
|
|
|
class Polygon : public MultiPoint {
|
|
|
|
public:
|
2014-01-07 14:40:38 +00:00
|
|
|
operator Polygons() const;
|
2014-04-28 18:14:20 +00:00
|
|
|
Point& operator[](Points::size_type idx);
|
|
|
|
const Point& operator[](Points::size_type idx) const;
|
2014-04-24 14:40:10 +00:00
|
|
|
Point last_point() const;
|
2013-09-03 17:26:58 +00:00
|
|
|
Lines lines() const;
|
2014-01-09 16:26:39 +00:00
|
|
|
void lines(Lines* lines) const;
|
2014-05-07 10:02:09 +00:00
|
|
|
void split_at(const Point &point, Polyline* polyline) const;
|
|
|
|
void split_at_index(int index, Polyline* polyline) const;
|
|
|
|
void split_at_first_point(Polyline* polyline) const;
|
|
|
|
void equally_spaced_points(double distance, Points* points) const;
|
2013-08-26 20:50:26 +00:00
|
|
|
double area() const;
|
|
|
|
bool is_counter_clockwise() const;
|
2013-08-26 23:26:44 +00:00
|
|
|
bool is_clockwise() const;
|
2013-07-16 19:09:29 +00:00
|
|
|
bool make_counter_clockwise();
|
|
|
|
bool make_clockwise();
|
2013-08-26 21:27:51 +00:00
|
|
|
bool is_valid() const;
|
2014-04-24 14:40:10 +00:00
|
|
|
bool contains_point(const Point &point) const;
|
2013-11-21 19:25:24 +00:00
|
|
|
Polygons simplify(double tolerance) const;
|
|
|
|
void simplify(double tolerance, Polygons &polygons) const;
|
2014-04-24 14:59:36 +00:00
|
|
|
void triangulate_convex(Polygons* polygons) const;
|
2013-09-13 12:48:40 +00:00
|
|
|
|
|
|
|
#ifdef SLIC3RXS
|
2014-01-11 23:54:10 +00:00
|
|
|
void from_SV_check(SV* poly_sv);
|
2013-09-13 12:48:40 +00:00
|
|
|
SV* to_SV_ref();
|
|
|
|
SV* to_SV_clone_ref() const;
|
|
|
|
#endif
|
2013-07-15 21:28:23 +00:00
|
|
|
};
|
2013-07-15 14:21:09 +00:00
|
|
|
|
2013-07-14 13:53:53 +00:00
|
|
|
}
|
|
|
|
|
2014-04-24 11:43:24 +00:00
|
|
|
// start Boost
|
|
|
|
#include <boost/polygon/polygon.hpp>
|
|
|
|
namespace boost { namespace polygon {
|
|
|
|
template <>
|
|
|
|
struct geometry_concept<Polygon>{ typedef polygon_concept type; };
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_traits<Polygon> {
|
|
|
|
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 Polygon& t) {
|
|
|
|
return t.points.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the end iterator
|
|
|
|
static inline iterator_type end_points(const Polygon& t) {
|
|
|
|
return t.points.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the number of sides of the polygon
|
|
|
|
static inline std::size_t size(const Polygon& t) {
|
|
|
|
return t.points.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the winding direction of the polygon
|
|
|
|
static inline winding_direction winding(const Polygon& t) {
|
|
|
|
return unknown_winding;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_mutable_traits<Polygon> {
|
|
|
|
// expects stl style iterators
|
|
|
|
template <typename iT>
|
|
|
|
static inline Polygon& set_points(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<Polygons> { typedef polygon_set_concept type; };
|
|
|
|
|
|
|
|
//next we map to the concept through traits
|
|
|
|
template <>
|
|
|
|
struct polygon_set_traits<Polygons> {
|
|
|
|
typedef coord_t coordinate_type;
|
|
|
|
typedef Polygons::const_iterator iterator_type;
|
|
|
|
typedef Polygons operator_arg_type;
|
|
|
|
|
|
|
|
static inline iterator_type begin(const Polygons& polygon_set) {
|
|
|
|
return polygon_set.begin();
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline iterator_type end(const Polygons& polygon_set) {
|
|
|
|
return polygon_set.end();
|
|
|
|
}
|
|
|
|
|
|
|
|
//don't worry about these, just return false from them
|
|
|
|
static inline bool clean(const Polygons& polygon_set) { return false; }
|
|
|
|
static inline bool sorted(const Polygons& polygon_set) { return false; }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
|
|
|
struct polygon_set_mutable_traits<Polygons> {
|
|
|
|
template <typename input_iterator_type>
|
|
|
|
static inline void set(Polygons& polygons, input_iterator_type input_begin, input_iterator_type input_end) {
|
|
|
|
polygons.assign(input_begin, input_end);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
} }
|
|
|
|
// end Boost
|
|
|
|
|
2013-07-14 13:53:53 +00:00
|
|
|
#endif
|