songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix warnings

This commit is contained in:
Laurent Rineau 2025-05-11 23:00:33 +02:00
parent 71120ff1f2
commit 3409d4c974
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Constrained_triangulation_3/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h
View File

@ -616,7 +616,7 @@ public:
for(auto f : faces(mesh)) { for(auto f : faces(mesh)) {
max_patch_id = (std::max)(max_patch_id, get(mesh_face_patch_map, f)); 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); patch_edges.resize(number_of_patches);
for(auto h : halfedges(mesh)) { for(auto h : halfedges(mesh)) {
if(is_border(h, mesh)) if(is_border(h, mesh))

4
Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
View File

@ -178,8 +178,8 @@ namespace Polygon_mesh {
CGAL_precondition(vertices.size() >= 3); CGAL_precondition(vertices.size() >= 3);
auto vertex = vertices.begin(); auto vertex = vertices.begin();
const Point_3& p1 = get(m_vertex_to_point_map, *vertex); ++vertex; 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 p2 = get(m_vertex_to_point_map, *vertex); ++vertex;
Point_3 p3 = get(m_vertex_to_point_map, *vertex); Point_3 p3 = get(m_vertex_to_point_map, *vertex);
while(collinear(p1, p2, p3)) while(collinear(p1, p2, p3))
{ {