mirror of https://github.com/CGAL/cgal
limit to 1M pair tested in bench_thingi10K
This commit is contained in:
parent
f1ebfd1f08
commit
676495c5c1
|
|
@ -51,9 +51,10 @@ struct Test
|
||||||
typedef CGAL::Box_intersection_d::Box_with_handle_d<double,3,Iterator> CBox;
|
typedef CGAL::Box_intersection_d::Box_with_handle_d<double,3,Iterator> CBox;
|
||||||
|
|
||||||
size_t nb_closed_pairs;
|
size_t nb_closed_pairs;
|
||||||
|
size_t nb_tested_pairs;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
Test() : nb_closed_pairs(0){ }
|
Test() : nb_closed_pairs(0), nb_tested_pairs(0){ }
|
||||||
|
|
||||||
void close_triangles(std::vector<P> &points, std::vector<boost::container::small_vector<std::size_t, 3> >& triangles, FT d2){
|
void close_triangles(std::vector<P> &points, std::vector<boost::container::small_vector<std::size_t, 3> >& triangles, FT d2){
|
||||||
std::vector< CBox > boxes;
|
std::vector< CBox > boxes;
|
||||||
|
|
@ -74,6 +75,10 @@ public:
|
||||||
if(v.size()!=0) //they have common vertices
|
if(v.size()!=0) //they have common vertices
|
||||||
return;
|
return;
|
||||||
|
|
||||||
|
nb_tested_pairs++;
|
||||||
|
if(nb_tested_pairs>1000000)
|
||||||
|
return;
|
||||||
|
|
||||||
T tr1(points[a[0]], points[a[1]], points[a[2]]);
|
T tr1(points[a[0]], points[a[1]], points[a[2]]);
|
||||||
T tr2(points[b[0]], points[b[1]], points[b[2]]);
|
T tr2(points[b[0]], points[b[1]], points[b[2]]);
|
||||||
bool comp = K().compare_squared_distance_3_object()(tr1, tr2, d2)!=CGAL::LARGER;
|
bool comp = K().compare_squared_distance_3_object()(tr1, tr2, d2)!=CGAL::LARGER;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue