32 V2d_t min = points.front();
34 typedef typename std::vector<V2d_t>::const_iterator Cit;
35 for(Cit it = points.begin(); it != points.end(); ++it)
37 min = V2d_t(std::min(min.x, it->x), std::min(min.y, it->y));
38 max = V2d_t(std::max(max.x, it->x), std::max(max.y, it->y));
40 m_kdTree = KDTree_t(min, max);
41 for(
VertInd i(0); i < points.size(); ++i)
43 m_kdTree.insert(i, points);