diff --git a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_gredner.cpp b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_gredner.cpp index a9ba00a52e7..212f0306e20 100644 --- a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_gredner.cpp +++ b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_gredner.cpp @@ -14,7 +14,6 @@ int main() #else #include "./types.h" -#include #include #include @@ -82,13 +81,13 @@ bool test(const char *filename) { { // if (true) { // if (pre_run) { - // Delaunay_triangulation_2 t; + // Delaunay_triangulation_2 t; // test(pts, t); // } // std::clock_t total_start = std::clock(); // for (int i=0; i t; + // Delaunay_triangulation_2 t; // test(pts, t); // } // double total_time = (std::clock()-total_start)/(double)CLOCKS_PER_SEC; @@ -120,7 +119,7 @@ bool test(const char *filename) { int main(int argc, char * argv[]) { - typedef Periodic_2_Delaunay_triangulation_2 T; + typedef Periodic_2_Delaunay_triangulation_2 T; srand(42); int result = 0; diff --git a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_test.cpp b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_test.cpp index b8675614e8c..2468e882930 100644 --- a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_test.cpp +++ b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/test_p2t2_performance_test.cpp @@ -17,7 +17,7 @@ int main() #include #include -typedef Triangulation_2 EuclideanTriangulation; +typedef Triangulation_2 EuclideanTriangulation; const int N_RUNS = 2; const int N_PTS = 50000; @@ -50,8 +50,9 @@ int main() pts.resize(500000); for (size_t i = 0; i < pts.size(); ++i) pts[i] = *(++g) + midpoint; - Gt gt; - for (size_t i = 0; i < pts.size() - 2; ++i) gt.orientation_2_object()(pts[i], pts[i + 1], pts[i + 2]); + P2TT gt; + for (size_t i = 0; i < pts.size() - 2; ++i) + gt.orientation_2_object()(pts[i], pts[i + 1], pts[i + 2]); return 0; #endif