void quickhull(const pointVec_t &points, pointVec_t &hull) {
if (points.size() < 2) {
hull.insert(hull.end(), points.begin(), points.end());
return;
}
point_t p_maxx = extremum<FindXExtremum::maxX>(points);
point_t p_minx = extremum<FindXExtremum::minX>(points);
pointVec_t H;
divide_and_conquer(points, hull, p_maxx, p_minx);
divide_and_conquer(points, H, p_minx, p_maxx);
hull.insert(hull.end(), H.begin(), H.end());
}
point_t divide(const pointVec_t &P, pointVec_t &P_reduced, const point_t &p1, const point_t &p2) {
SplitByCP splitByCP(p1, p2, P_reduced);
point_t farPoint = std::for_each(P.begin(), P.end(), splitByCP);
if(util::verbose) {
std::stringstream ss;
ss << P.size() << " nodes in bucket"<< ", "
<< "dividing by: [ " << p1 << ", " << p2 << " ], "
<< "farthest node: " << farPoint;
util::OUTPUT.push_back(ss.str());
}
return farPoint;
}
void quickhull(const pointVec_t &points, pointVec_t &hull, bool buffered) {
if (points.size() < 2) {
#if USECONCVEC
appendVector(points, hull);
#else // STD::VECTOR
hull.insert(hull.end(), points.begin(), points.end());
#endif // USECONCVEC
return;
}
point_t p_maxx = extremum<FindXExtremum::maxX>(points);
point_t p_minx = extremum<FindXExtremum::minX>(points);
pointVec_t H;
divide_and_conquer(points, hull, p_maxx, p_minx, buffered);
divide_and_conquer(points, H, p_minx, p_maxx, buffered);
#if USECONCVEC
appendVector(H, hull);
#else // STD::VECTOR
hull.insert(hull.end(), H.begin(), H.end());
#endif // USECONCVEC
}
void appendVector(const pointVec_t& src, pointVec_t& dest) {
std::copy(src.begin(), src.end(), dest.grow_by(src.size()));
}
point_t extremum(const pointVec_t &points) {
assert(!points.empty());
return std::for_each(points.begin(), points.end(), FindXExtremum(points[0], type));
}
void appendVector(mutex_t& insertMutex, const pointVec_t& src, pointVec_t& dest) {
mutex_t::scoped_lock lock(insertMutex);
dest.insert(dest.end(), src.begin(), src.end());
}