diff --git a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
index 866b2d2b762..28fdf21f010 100644
--- a/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
+++ b/Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
@@ -616,7 +616,7 @@ public:
       for(auto f : faces(mesh)) {
         max_patch_id = (std::max)(max_patch_id, get(mesh_face_patch_map, f));
       }
-      number_of_patches = max_patch_id + 1;
+      number_of_patches = static_cast<int>(max_patch_id + 1);
       patch_edges.resize(number_of_patches);
       for(auto h : halfedges(mesh)) {
         if(is_border(h, mesh))
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
index fdc71066581..3ac12c3dea7 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
@@ -178,8 +178,8 @@ namespace Polygon_mesh {
       CGAL_precondition(vertices.size() >= 3);
 
       auto vertex = vertices.begin();
-      const Point_3& p1 = get(m_vertex_to_point_map, *vertex); ++vertex;
-      const Point_3& p2 = get(m_vertex_to_point_map, *vertex); ++vertex;
+      Point_3 p1 = get(m_vertex_to_point_map, *vertex); ++vertex;
+      Point_3 p2 = get(m_vertex_to_point_map, *vertex); ++vertex;
       Point_3 p3 = get(m_vertex_to_point_map, *vertex);
       while(collinear(p1, p2, p3))
       {