diff --git a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
index aa26d5a5b07..52b754b097a 100644
--- a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
@@ -192,8 +192,8 @@ public:
       std::random_shuffle (points.begin(), points.end());
       spatial_sort (points.begin(), points.end(), geom_traits());
       Face_handle f;
-      for (typename std::vector<Point>::const_iterator p = points.begin();
-              p != points.end(); ++p)
+      for (typename std::vector<Point>::const_iterator p = points.begin(), end = points.end();
+              p != end; ++p)
           f = insert (*p, f)->face();
 
       return number_of_vertices() - n;
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
index 5b789200eb7..6976fd06063 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
@@ -255,8 +255,8 @@ public:
       CGAL::spatial_sort (points.begin(), points.end(), geom_traits());
 
       Face_handle hint;
-      for (typename std::vector<Point>::const_iterator p = points.begin();
-              p != points.end(); ++p)
+      for (typename std::vector<Point>::const_iterator p = points.begin(), end = points.end();
+              p != end; ++p)
           hint = insert (*p, hint)->face();
 
       return number_of_vertices() - n;
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
index c7aac5de6ec..d1839127abb 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
@@ -210,8 +210,8 @@ public:
     spatial_sort (points.begin(), points.end(), geom_traits());
 
     Face_handle hint;
-    for (typename std::vector<Point>::const_iterator p = points.begin();
-            p != points.end(); ++p)
+    for (typename std::vector<Point>::const_iterator p = points.begin(), end = points.end();
+            p != end; ++p)
         hint = insert (*p, hint)->face();
 
     return number_of_vertices() - n;
diff --git a/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
index 2e1d142acf6..a48805bb1be 100644
--- a/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
@@ -164,8 +164,8 @@ public:
       std::random_shuffle (points.begin(), points.end());
       spatial_sort (points.begin(), points.end(), geom_traits());
       Face_handle f;
-      for (typename std::vector<Point>::const_iterator p = points.begin();
-              p != points.end(); ++p)
+      for (typename std::vector<Point>::const_iterator p = points.begin(), end = points.end();
+              p != end; ++p)
           f = insert (*p, f)->face();
 
       return this->number_of_vertices() - n;
diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
index 79a031b950f..5743f7a1b65 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
@@ -336,8 +336,9 @@ public:
       spatial_sort (points.begin(), points.end(), geom_traits());
 
       Face_handle hint;
-      for (typename std::vector<Weighted_point>::const_iterator p = points.begin();
-              p != points.end(); ++p)
+      for (typename std::vector<Weighted_point>::const_iterator p = points.begin(),
+		      end = points.end();
+              p != end; ++p)
           hint = insert (*p, hint)->face();
 
       return number_of_vertices() - n;
diff --git a/Triangulation_2/include/CGAL/Triangulation_2.h b/Triangulation_2/include/CGAL/Triangulation_2.h
index 8bc2d038704..5c9e369d30a 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2.h
@@ -443,8 +443,8 @@ int insert(InputIterator first, InputIterator last)
   std::random_shuffle (points.begin(), points.end());
   spatial_sort (points.begin(), points.end(), geom_traits());
   Face_handle f;
-  for (typename std::vector<Point>::const_iterator p = points.begin();
-          p != points.end(); ++p)
+  for (typename std::vector<Point>::const_iterator p = points.begin(), end = points.end();
+          p != end; ++p)
       f = insert (*p, f)->face();
 
   return number_of_vertices() - n;
diff --git a/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h
index 847670a59b0..d8dd8d35ab6 100644
--- a/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h
@@ -105,8 +105,8 @@ public:
       CGAL::spatial_sort (points.begin(), points.end(), geom_traits());
 
       Face_handle hint;
-      for (typename std::vector<Point>::const_iterator p = points.begin();
-              p != points.end(); ++p)
+      for (typename std::vector<Point>::const_iterator p = points.begin(), end = points.end();
+              p != end; ++p)
           hint = insert (*p, hint)->face();
 
       return this->number_of_vertices() - n;