3DPrinting/PrusaSlicer-NonPlainar
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Documented MultiPoint.

Browse Source
This commit is contained in:
bubnikv 2016-09-26 12:44:45 +02:00
parent 758458e5a0
commit 4046552dd1
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
xs/src/libslic3r/MultiPoint.cpp
View File

@ -171,9 +171,12 @@ MultiPoint::dump_perl() const
return ret.str(); return ret.str();
} }
//FIXME This is very inefficient in term of memory use.
// The recursive algorithm shall run in place, not allocating temporary data in each recursion.
Points Points
MultiPoint::_douglas_peucker(const Points &points, const double tolerance) MultiPoint::_douglas_peucker(const Points &points, const double tolerance)
{ {
assert(points.size() >= 2);
Points results; Points results;
double dmax = 0; double dmax = 0;
size_t index = 0; size_t index = 0;
@ -190,13 +193,15 @@ MultiPoint::_douglas_peucker(const Points &points, const double tolerance)
Points dp0; Points dp0;
dp0.reserve(index + 1); dp0.reserve(index + 1);
dp0.insert(dp0.end(), points.begin(), points.begin() + index + 1); dp0.insert(dp0.end(), points.begin(), points.begin() + index + 1);
// Recursive call.
Points dp1 = MultiPoint::_douglas_peucker(dp0, tolerance); Points dp1 = MultiPoint::_douglas_peucker(dp0, tolerance);
results.reserve(results.size() + dp1.size() - 1); results.reserve(results.size() + dp1.size() - 1);
results.insert(results.end(), dp1.begin(), dp1.end() - 1); results.insert(results.end(), dp1.begin(), dp1.end() - 1);
dp0.clear(); dp0.clear();
dp0.reserve(points.size() - index + 1); dp0.reserve(points.size() - index);
dp0.insert(dp0.end(), points.begin() + index, points.end()); dp0.insert(dp0.end(), points.begin() + index, points.end());
// Recursive call.
dp1 = MultiPoint::_douglas_peucker(dp0, tolerance); dp1 = MultiPoint::_douglas_peucker(dp0, tolerance);
results.reserve(results.size() + dp1.size()); results.reserve(results.size() + dp1.size());
results.insert(results.end(), dp1.begin(), dp1.end()); results.insert(results.end(), dp1.begin(), dp1.end());