From a27694ad44b2fc4e5ab2df92f0167caefe83a06e Mon Sep 17 00:00:00 2001 From: Jane Tournois Date: Tue, 10 Jun 2025 09:58:34 +0200 Subject: [PATCH] doc 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 f0a16b2d919..e54d7592d68 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 @@ -119,7 +119,7 @@ Right: the same CCDT seen with cutplane. There is no universal or canonical way to represent all possible PLCs in \cgal. Any polyhedral surface is a PLC, so any model of `FaceListGraph`, such as `CGAL::Surface_mesh`, can be -used to represent a PLC. +used to represent such a PLC. In this representation, the faces of the PLC correspond to the faces of the surface mesh—a collection of vertices (points), edges, and faces that cover the surface of a geometric object.