PrusaSlicer-NonPlainar/xs/src/Polygon.cpp

201 lines
4.4 KiB
C++
Raw Normal View History

#include <myinit.h>
#include "ClipperUtils.hpp"
#include "Polygon.hpp"
#include "Polyline.hpp"
namespace Slic3r {
Polygon::operator Polygons() const
{
Polygons pp;
pp.push_back(*this);
return pp;
}
Point
Polygon::last_point() const
{
return this->points.front(); // last point == first point for polygons
}
Lines
Polygon::lines() const
{
Lines lines;
this->lines(&lines);
return lines;
}
void
Polygon::lines(Lines* lines) const
{
lines->reserve(lines->size() + this->points.size());
2013-09-13 13:19:15 +00:00
for (Points::const_iterator it = this->points.begin(); it != this->points.end()-1; ++it) {
lines->push_back(Line(*it, *(it + 1)));
}
lines->push_back(Line(this->points.back(), this->points.front()));
}
2013-08-26 20:39:35 +00:00
Polyline*
Polygon::split_at(const Point &point) const
2013-08-26 20:39:35 +00:00
{
// find index of point
for (Points::const_iterator it = this->points.begin(); it != this->points.end(); ++it) {
2013-09-13 13:19:15 +00:00
if (it->coincides_with(point))
2013-08-26 20:39:35 +00:00
return this->split_at_index(it - this->points.begin());
}
2013-09-13 13:19:15 +00:00
CONFESS("Point not found");
return NULL;
2013-08-26 20:39:35 +00:00
}
Polyline*
2013-09-13 13:19:15 +00:00
Polygon::split_at_index(int index) const
{
Polyline* poly = new Polyline;
2013-09-13 13:19:15 +00:00
poly->points.reserve(this->points.size() + 1);
for (Points::const_iterator it = this->points.begin() + index; it != this->points.end(); ++it)
poly->points.push_back(*it);
for (Points::const_iterator it = this->points.begin(); it != this->points.begin() + index + 1; ++it)
poly->points.push_back(*it);
return poly;
}
Polyline*
2013-09-13 13:19:15 +00:00
Polygon::split_at_first_point() const
{
return this->split_at_index(0);
}
Points
Polygon::equally_spaced_points(double distance) const
{
Polyline* polyline = this->split_at_first_point();
Points pts = polyline->equally_spaced_points(distance);
delete polyline;
return pts;
}
2013-08-26 20:44:40 +00:00
double
2013-08-26 20:50:26 +00:00
Polygon::area() const
2013-08-26 20:44:40 +00:00
{
2013-11-20 14:59:19 +00:00
ClipperLib::Path p;
2013-11-21 13:15:38 +00:00
Slic3rMultiPoint_to_ClipperPath(*this, p);
2013-08-26 20:44:40 +00:00
return ClipperLib::Area(p);
}
bool
2013-08-26 20:50:26 +00:00
Polygon::is_counter_clockwise() const
{
2013-11-21 13:15:38 +00:00
ClipperLib::Path p;
Slic3rMultiPoint_to_ClipperPath(*this, p);
return ClipperLib::Orientation(p);
}
2013-08-26 23:26:44 +00:00
bool
Polygon::is_clockwise() const
{
return !this->is_counter_clockwise();
}
bool
Polygon::make_counter_clockwise()
{
if (!this->is_counter_clockwise()) {
this->reverse();
return true;
}
return false;
}
bool
Polygon::make_clockwise()
{
if (this->is_counter_clockwise()) {
this->reverse();
return true;
}
return false;
}
bool
Polygon::is_valid() const
{
return this->points.size() >= 3;
}
bool
Polygon::contains_point(const Point &point) const
{
// http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
2013-11-21 17:42:16 +00:00
bool result = false;
Points::const_iterator i = this->points.begin();
Points::const_iterator j = this->points.end() - 1;
for (; i != this->points.end(); j = i++) {
if ( ((i->y > point.y) != (j->y > point.y))
&& (point.x < (j->x - i->x) * (point.y - i->y) / (j->y - i->y) + i->x) )
result = !result;
}
return result;
}
Polygons
Polygon::simplify(double tolerance) const
{
2013-11-22 01:16:10 +00:00
Polygon p = *this;
p.points = MultiPoint::_douglas_peucker(p.points, tolerance);
2013-11-22 01:16:10 +00:00
Polygons pp;
pp.push_back(p);
simplify_polygons(pp, pp);
return pp;
}
void
Polygon::simplify(double tolerance, Polygons &polygons) const
{
Polygons pp = this->simplify(tolerance);
polygons.reserve(polygons.size() + pp.size());
polygons.insert(polygons.end(), pp.begin(), pp.end());
}
// Only call this on convex polygons or it will return invalid results
void
Polygon::triangulate_convex(Polygons* polygons) const
{
for (Points::const_iterator it = this->points.begin() + 2; it != this->points.end(); ++it) {
Polygon p;
p.points.reserve(3);
p.points.push_back(this->points.front());
p.points.push_back(*(it-1));
p.points.push_back(*it);
polygons->push_back(p);
}
}
#ifdef SLIC3RXS
SV*
Polygon::to_SV_ref() {
SV* sv = newSV(0);
sv_setref_pv( sv, "Slic3r::Polygon::Ref", (void*)this );
return sv;
}
SV*
Polygon::to_SV_clone_ref() const {
SV* sv = newSV(0);
sv_setref_pv( sv, "Slic3r::Polygon", new Polygon(*this) );
return sv;
}
void
Polygon::from_SV_check(SV* poly_sv)
{
if (sv_isobject(poly_sv) && !sv_isa(poly_sv, "Slic3r::Polygon") && !sv_isa(poly_sv, "Slic3r::Polygon::Ref"))
CONFESS("Not a valid Slic3r::Polygon object");
MultiPoint::from_SV_check(poly_sv);
}
#endif
}