2013-11-22 21:38:30 +00:00
|
|
|
#ifndef slic3r_Geometry_hpp_
|
|
|
|
#define slic3r_Geometry_hpp_
|
|
|
|
|
2015-12-07 23:39:54 +00:00
|
|
|
#include "libslic3r.h"
|
2014-01-09 18:56:12 +00:00
|
|
|
#include "BoundingBox.hpp"
|
2013-11-22 21:38:30 +00:00
|
|
|
#include "Polygon.hpp"
|
2014-01-10 15:18:55 +00:00
|
|
|
#include "Polyline.hpp"
|
2013-11-22 21:38:30 +00:00
|
|
|
|
2014-01-09 18:56:12 +00:00
|
|
|
#include "boost/polygon/voronoi.hpp"
|
|
|
|
using boost::polygon::voronoi_builder;
|
|
|
|
using boost::polygon::voronoi_diagram;
|
|
|
|
|
2013-11-23 20:54:56 +00:00
|
|
|
namespace Slic3r { namespace Geometry {
|
2013-11-22 21:38:30 +00:00
|
|
|
|
2015-01-19 17:53:04 +00:00
|
|
|
Polygon convex_hull(Points points);
|
|
|
|
Polygon convex_hull(const Polygons &polygons);
|
2014-11-09 11:25:59 +00:00
|
|
|
void chained_path(const Points &points, std::vector<Points::size_type> &retval, Point start_near);
|
|
|
|
void chained_path(const Points &points, std::vector<Points::size_type> &retval);
|
2013-11-23 22:21:59 +00:00
|
|
|
template<class T> void chained_path_items(Points &points, T &items, T &retval);
|
2014-05-02 16:46:22 +00:00
|
|
|
bool directions_parallel(double angle1, double angle2, double max_diff = 0);
|
2014-11-23 19:14:13 +00:00
|
|
|
template<class T> bool contains(const std::vector<T> &vector, const Point &point);
|
2014-11-15 21:41:22 +00:00
|
|
|
double rad2deg(double angle);
|
|
|
|
double rad2deg_dir(double angle);
|
|
|
|
double deg2rad(double angle);
|
2015-01-30 17:33:20 +00:00
|
|
|
void simplify_polygons(const Polygons &polygons, double tolerance, Polygons* retval);
|
2013-11-22 21:38:30 +00:00
|
|
|
|
2015-04-29 17:19:07 +00:00
|
|
|
class ArrangeItem {
|
|
|
|
public:
|
|
|
|
Pointf pos;
|
|
|
|
size_t index_x, index_y;
|
|
|
|
coordf_t dist;
|
|
|
|
};
|
|
|
|
class ArrangeItemIndex {
|
|
|
|
public:
|
|
|
|
coordf_t index;
|
|
|
|
ArrangeItem item;
|
|
|
|
ArrangeItemIndex(coordf_t _index, ArrangeItem _item) : index(_index), item(_item) {};
|
|
|
|
};
|
|
|
|
double linint(double value, double oldmin, double oldmax, double newmin, double newmax);
|
2015-12-02 17:06:18 +00:00
|
|
|
Pointfs arrange(size_t total_parts, Pointf part, coordf_t dist, const BoundingBoxf* bb);
|
2015-04-29 17:19:07 +00:00
|
|
|
|
2014-01-09 18:56:12 +00:00
|
|
|
class MedialAxis {
|
|
|
|
public:
|
|
|
|
Points points;
|
|
|
|
Lines lines;
|
2014-03-09 16:46:02 +00:00
|
|
|
double max_width;
|
|
|
|
double min_width;
|
|
|
|
MedialAxis(double _max_width, double _min_width) : max_width(_max_width), min_width(_min_width) {};
|
2014-01-09 18:56:12 +00:00
|
|
|
void build(Polylines* polylines);
|
|
|
|
|
|
|
|
private:
|
2014-01-10 15:18:55 +00:00
|
|
|
typedef voronoi_diagram<double> VD;
|
|
|
|
VD vd;
|
2014-03-03 00:48:05 +00:00
|
|
|
std::set<const VD::edge_type*> edges;
|
2014-03-05 17:43:01 +00:00
|
|
|
Line edge_to_line(const VD::edge_type &edge) const;
|
2014-03-04 22:33:13 +00:00
|
|
|
void process_edge_neighbors(const voronoi_diagram<double>::edge_type& edge, Points* points);
|
|
|
|
bool is_valid_edge(const voronoi_diagram<double>::edge_type& edge) const;
|
2015-05-13 18:47:26 +00:00
|
|
|
const Line& retrieve_segment(const voronoi_diagram<double>::cell_type& cell) const;
|
2014-01-09 18:56:12 +00:00
|
|
|
};
|
|
|
|
|
2013-11-23 20:54:56 +00:00
|
|
|
} }
|
2013-11-22 21:38:30 +00:00
|
|
|
|
|
|
|
#endif
|