From b49dccb35d792b0e86ec35e0d497dd1a0e0f3a30 Mon Sep 17 00:00:00 2001 From: Jane Tournois Date: Mon, 26 May 2025 15:44:02 +0200 Subject: [PATCH] vocabulary Co-authored-by: Sebastien Loriot --- .../Constrained_triangulation_3/Constrained_triangulation_3.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt index a75af9db1a7..c14df00612c 100644 --- a/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt +++ b/Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt @@ -233,7 +233,7 @@ but it requires the input mesh to be triangulated. Therefore, the input mesh mus using `CGAL::Polygon_mesh_processing::triangulate_faces()` before performing the self-intersection check. If self-intersections are found, the triangulated mesh is converted into a triangle soup, which can then be -processed with `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` to remove the self-intersections. +processed with `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` to resolve the self-intersections. \cgalExample{Constrained_triangulation_3/ccdt_3_preprocessing.cpp }