PrusaSlicer-NonPlainar/xs/src/PolylineCollection.cpp

54 lines
1.7 KiB
C++
Raw Normal View History

2013-08-29 22:06:10 +00:00
#include "PolylineCollection.hpp"
namespace Slic3r {
void
PolylineCollection::chained_path(PolylineCollection* retval, bool no_reverse) const
2013-08-29 22:06:10 +00:00
{
if (this->polylines.empty()) return;
this->chained_path_from(this->polylines.front().first_point(), retval, no_reverse);
2013-08-29 22:06:10 +00:00
}
void
PolylineCollection::chained_path_from(Point start_near, PolylineCollection* retval, bool no_reverse) const
2013-08-29 22:06:10 +00:00
{
Polylines my_paths = this->polylines;
Points endpoints;
for (Polylines::const_iterator it = my_paths.begin(); it != my_paths.end(); ++it) {
endpoints.push_back(it->first_point());
2013-08-29 22:06:10 +00:00
if (no_reverse) {
endpoints.push_back(it->first_point());
2013-08-29 22:06:10 +00:00
} else {
endpoints.push_back(it->last_point());
2013-08-29 22:06:10 +00:00
}
}
while (!my_paths.empty()) {
// find nearest point
int start_index = start_near.nearest_point_index(endpoints);
2013-08-29 22:06:10 +00:00
int path_index = start_index/2;
if (start_index % 2 && !no_reverse) {
my_paths.at(path_index).reverse();
}
retval->polylines.push_back(my_paths.at(path_index));
my_paths.erase(my_paths.begin() + path_index);
endpoints.erase(endpoints.begin() + 2*path_index, endpoints.begin() + 2*path_index + 2);
start_near = retval->polylines.back().last_point();
}
}
Point
2013-11-21 13:15:38 +00:00
PolylineCollection::leftmost_point() const
{
if (this->polylines.empty()) CONFESS("leftmost_point() called on empty PolylineCollection");
Point p = this->polylines.front().leftmost_point();
for (Polylines::const_iterator it = this->polylines.begin() + 1; it != this->polylines.end(); ++it) {
Point p2 = it->leftmost_point();
if (p2.x < p.x) p = p2;
2013-11-21 13:15:38 +00:00
}
return p;
2013-11-21 13:15:38 +00:00
}
2013-08-29 22:06:10 +00:00
}