bool detect(vector<Triangle_3> &a, vector<Triangle_3> &b) { std::vector<Box> boxes; triangles.clear(); for ( Iterator i = a.begin(); i != a.end(); ++i) triangles.push_back(*i); for ( Iterator i = b.begin(); i != b.end(); ++i) triangles.push_back(*i); for(Iterator i = triangles.begin(); i!= triangles.end(); ++i) boxes.push_back( Box( i->bbox(), i)); // Run the self intersection algorithm with all defaults CGAL::box_self_intersection_d( boxes.begin(), boxes.end(), report_inters); return true; }
void KeyEdge::triangulate_(double width, Time time, Triangles & out) const { out.clear(); if (exists(time)) geometry()->triangulate(width, out); }
void EdgeCell::triangulate(Time /*time*/, Triangles & out) { out.clear(); }
void EdgeCell::triangulate(double /*width*/, Time /*time*/, Triangles & out) { out.clear(); }