From a8eb8c737cc181daa36afb451f870591ef1c3dfd Mon Sep 17 00:00:00 2001 From: lvalque <131978677+LeoValque@users.noreply.github.com> Date: Mon, 19 May 2025 10:01:04 +0200 Subject: [PATCH] Update Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/triangle_soup_snap_rounding.h Co-authored-by: Andreas Fabri --- .../internal/triangle_soup_snap_rounding.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/triangle_soup_snap_rounding.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/triangle_soup_snap_rounding.h index cf37b048e55..ecd2576db6d 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/triangle_soup_snap_rounding.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/triangle_soup_snap_rounding.h @@ -173,7 +173,7 @@ struct Wrap_snap_visitor : public Autorefinement::Default_visitor * * Rounds the coordinates of the points so that they fit in doubles while making and keeping the model intersection free by potentially subdividing the triangles. * The input can be any triangle soup and the output is an intersection-free triangle soup with Hausdorff distance -* between the input and the output bounded by M*2^-gs*k where M is the maximum absolute coordinate in the model, gs the snap_grid_size (see below) and k the number of iteration +* between the input and the output bounded by `M*2^-gs*k` where `M`is the maximum absolute coordinate in the model, `gs` the `snap_grid_size` (see below) and `k` the number of iterations * performed by the algorithm. * * @tparam PointRange a model of the concept `RandomAccessContainer`