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

Update Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h 

Co-authored-by: Sebastien Loriot <sloriot.ml@gmail.com>
This commit is contained in:
lvalque 2025-04-29 14:01:36 +02:00 committed by GitHub
parent f39de8cb66
commit 7868d68902
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
View File

@ -1628,7 +1628,7 @@ bool autorefine_triangle_soup(PointRange& soup_points,
* `soup_triangles` will be updated to contain both the input triangles and the new subdivided triangles. Degenerate triangles will be removed.
* Also triangles in `soup_triangles` will be triangles without intersection first, followed by triangles coming from a subdivision induced
* by an intersection. The named parameter `visitor()` can be used to track
* the creation of new triangles.
* the creation and removal of triangles.
* If the `apply_iterative_snap_rounding()` parameter is set to `true`, the coordinates of the vertices are rounded to fit within the precision of a double-precision floating point,
* while trying to make the triangle soup free of intersections. The `snap_grid_size()` parameter limits the drift of the snapped vertices.
* A smaller value is more likely to output an intersection free output and perform more vertex collapses, but it may increase the Hausdorff distance from the input.