diff --git a/Shape_detection/examples/Shape_detection/include/utils.h b/Shape_detection/examples/Shape_detection/include/utils.h
index f84cc741fb2..762ee7e0806 100644
--- a/Shape_detection/examples/Shape_detection/include/utils.h
+++ b/Shape_detection/examples/Shape_detection/include/utils.h
@@ -261,7 +261,7 @@ struct Insert_point_colored_by_region_index {
     const unsigned char g = static_cast<unsigned char>(64 + rand.get_int(0, 192));
     const unsigned char b = static_cast<unsigned char>(64 + rand.get_int(0, 192));
 
-    for (const Item index : region.second) {
+    for (Item index : region.second) {
       const auto& point = get(m_point_map, index);
       const auto it = m_output_range.insert(point);
 
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
index 041eb24cc6b..4f43bfa4ec3 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
@@ -326,7 +326,7 @@ namespace Point_set {
 
       // Flip the plane's normal to agree with all input normals.
       long votes_to_keep_normal = 0;
-      for (const Item item : region) {
+      for (Item item : region) {
         const Vector_3& normal = get(m_normal_map, item);
         const bool agrees =
           m_scalar_product_3(normal, unoriented_normal_of_best_fit) > FT(0);
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Region_growing.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Region_growing.h
index 8ebcefa76ab..e9dccb3e2d7 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Region_growing.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Region_growing.h
@@ -378,7 +378,7 @@ namespace Shape_detection {
             m_neighbor_query(item, neighbors);
 
             // Visit all found neighbors.
-            for (const Item neighbor : neighbors) {
+            for (Item neighbor : neighbors) {
 
               if (!get(m_visited, neighbor)) {
                 if (m_region_type.is_part_of_region(item, neighbor, region)) {
@@ -409,7 +409,7 @@ namespace Shape_detection {
           // Verify that associated elements are still within the tolerance.
           bool fits = true;
           Item former = region.front();
-          for (const Item item : region) {
+          for (Item item : region) {
             if (!m_region_type.is_part_of_region(former, item, region)) {
               fits = false;
               break;
@@ -452,7 +452,7 @@ namespace Shape_detection {
     }
 
     void revert(const Region& region) {
-      for (const Item item : region)
+      for (Item item : region)
         put(m_visited, item, false);
     }
   };