diff options
Diffstat (limited to 'src/libslic3r/MultiPoint.hpp')
-rw-r--r-- | src/libslic3r/MultiPoint.hpp | 110 |
1 files changed, 110 insertions, 0 deletions
diff --git a/src/libslic3r/MultiPoint.hpp b/src/libslic3r/MultiPoint.hpp new file mode 100644 index 000000000..03b89df51 --- /dev/null +++ b/src/libslic3r/MultiPoint.hpp @@ -0,0 +1,110 @@ +#ifndef slic3r_MultiPoint_hpp_ +#define slic3r_MultiPoint_hpp_ + +#include "libslic3r.h" +#include <algorithm> +#include <vector> +#include "Line.hpp" +#include "Point.hpp" + +namespace Slic3r { + +class BoundingBox; +class BoundingBox3; + +class MultiPoint +{ +public: + Points points; + + operator Points() const; + MultiPoint() {} + MultiPoint(const MultiPoint &other) : points(other.points) {} + MultiPoint(MultiPoint &&other) : points(std::move(other.points)) {} + MultiPoint(std::initializer_list<Point> list) : points(list) {} + explicit MultiPoint(const Points &_points) : points(_points) {} + MultiPoint& operator=(const MultiPoint &other) { points = other.points; return *this; } + MultiPoint& operator=(MultiPoint &&other) { points = std::move(other.points); return *this; } + void scale(double factor); + void translate(double x, double y); + void translate(const Point &vector); + void rotate(double angle) { this->rotate(cos(angle), sin(angle)); } + void rotate(double cos_angle, double sin_angle); + void rotate(double angle, const Point ¢er); + void reverse(); + Point first_point() const; + virtual Point last_point() const = 0; + virtual Lines lines() const = 0; + size_t size() const { return points.size(); } + bool empty() const { return points.empty(); } + double length() const; + bool is_valid() const { return this->points.size() >= 2; } + + int find_point(const Point &point) const; + bool has_boundary_point(const Point &point) const; + int closest_point_index(const Point &point) const { + int idx = -1; + if (! this->points.empty()) { + idx = 0; + double dist_min = (point - this->points.front()).cast<double>().norm(); + for (int i = 1; i < int(this->points.size()); ++ i) { + double d = (this->points[i] - point).cast<double>().norm(); + if (d < dist_min) { + dist_min = d; + idx = i; + } + } + } + return idx; + } + const Point* closest_point(const Point &point) const { return this->points.empty() ? nullptr : &this->points[this->closest_point_index(point)]; } + BoundingBox bounding_box() const; + // Return true if there are exact duplicates. + bool has_duplicate_points() const; + // Remove exact duplicates, return true if any duplicate has been removed. + bool remove_duplicate_points(); + void append(const Point &point) { this->points.push_back(point); } + void append(const Points &src) { this->append(src.begin(), src.end()); } + void append(const Points::const_iterator &begin, const Points::const_iterator &end) { this->points.insert(this->points.end(), begin, end); } + void append(Points &&src) + { + if (this->points.empty()) { + this->points = std::move(src); + } else { + this->points.insert(this->points.end(), src.begin(), src.end()); + src.clear(); + } + } + + bool intersection(const Line& line, Point* intersection) const; + bool first_intersection(const Line& line, Point* intersection) const; + + static Points _douglas_peucker(const Points &points, const double tolerance); +}; + +class MultiPoint3 +{ +public: + Points3 points; + + void append(const Vec3crd& point) { this->points.push_back(point); } + + void translate(double x, double y); + void translate(const Point& vector); + virtual Lines3 lines() const = 0; + double length() const; + bool is_valid() const { return this->points.size() >= 2; } + + BoundingBox3 bounding_box() const; + + // Remove exact duplicates, return true if any duplicate has been removed. + bool remove_duplicate_points(); +}; + +extern BoundingBox get_extents(const MultiPoint &mp); +extern BoundingBox get_extents_rotated(const std::vector<Point> &points, double angle); +extern BoundingBox get_extents_rotated(const MultiPoint &mp, double angle); + +} // namespace Slic3r + +#endif |