diff --git a/Triangulation_2/benchmark/Triangulation_2/Delaunay_remove.cpp b/Triangulation_2/benchmark/Triangulation_2/Delaunay_remove.cpp
index 08e8016e13c..b16269a50ab 100644
--- a/Triangulation_2/benchmark/Triangulation_2/Delaunay_remove.cpp
+++ b/Triangulation_2/benchmark/Triangulation_2/Delaunay_remove.cpp
@@ -4,8 +4,6 @@
 #include <CGAL/point_generators_2.h>
 
 #include <iostream>
-#include <fstream>
-#include <string>
 #include <vector>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel  K;
@@ -27,27 +25,29 @@ int main(int argc, char **argv)
   std::vector<Point> points;
   points.reserve(n);
   CGAL::Random_points_in_disc_2<Point,Creator> g(1);
-  CGAL::copy_n( g, n, std::back_inserter(points));
+  std::copy_n( g, n, std::back_inserter(points));
   Delaunay original;
   original.insert(points.begin(),points.end());
 
   double res=0;
   for (int r=0;r<rep;++r){
     Delaunay delaunay=original;
-    std::vector<Vertex_handle> vertices;
-    for(FVI fvi = delaunay.finite_vertices_begin(); fvi != delaunay.finite_vertices_end();++fvi){
-      vertices.push_back(fvi);
-    }
+    std::vector<Vertex_handle> vertices(delaunay.number_of_vertices());
+    std::copy(delaunay.finite_vertex_handles().begin(),
+         delaunay.finite_vertex_handles().end(),
+         vertices.begin());
     CGAL::Timer t;
     t.start();
-    for (int k=0; k<vertices.size(); ++k)
-      delaunay.remove(vertices[k]);
+    for (auto v : vertices) {
+      delaunay.remove(v);
+    }
     t.stop();
     res+=t.time();
     if (delaunay.number_of_vertices()!=0){
       std::cerr << "ERROR"<< std::endl;
       return 1;
     }
+    std::cerr << r << " : " << t.time() << std::endl;
   }
 
   std::cout << res/rep << std::endl;