user manual

Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt

@@ -864,6 +864,19 @@ vertices at identical positions, can be used to repair this configuration.
 \section PMPGeometricRepair Geometric Repair
 ****************************************
 
+\subsection PMPAutoref Self-intersection Resolution (Autorefinement) in Triangle Soups
+Given a soup of triangles, a self-intersection is defined as the intersection of two triangles from the soup
+such that the intersection is not defined by the convex hull of one, two or three shared vertices.
+In other words, it is an intersection that happens in the interior of one of the two triangles, or in the interior
+of one their edges, except if identical points are associated to different vertices of the triangle soup which
+would then also includes overlaps of duplicated points.
+
+The function `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` provides a way to refine a triangle soup
+using the intersections of the triangles from the soup. In particular, if some points are duplicated they will be
+merged. Note that if a kernel with exact predicates but inexact constructions is used, some new self-intersections
+might be introduced due to rounding issues of points coordinates.
+To guarantee that the triangle soup is free from self-intersections, a kernel with exact constructions must be used.
+
 \subsection PMPRemoveCapsNeedles Removal of Almost Degenerate Triangle Faces
 Triangle faces of a mesh made up of almost collinear points are badly shaped elements that
 might not be desirable to have in a mesh. The function

Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt

@@ -43,4 +43,5 @@
 \example Polygon_mesh_processing/cc_compatible_orientations.cpp
 \example Polygon_mesh_processing/remesh_planar_patches.cpp
 \example Polygon_mesh_processing/remesh_almost_planar_patches.cpp
+\example Polygon_mesh_processing/soup_autorefinement.cpp
 */