From 0bf4b10a3c7679320e483d04b5eb239444ea85c7 Mon Sep 17 00:00:00 2001 From: Jane Tournois Date: Thu, 3 Apr 2025 09:50:46 +0200 Subject: [PATCH] capitalize titles --- .../Constrained_triangulation_3.txt | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) 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 449f810f0c9..46a943178aa 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 @@ -112,7 +112,7 @@ are provided to create a `Conforming_constrained_Delaunay_triangulation_3` objec \section CT_3_examples Examples -\subsection CT_3_example_ccdt Build a conforming constrained Delaunay triangulation +\subsection CT_3_example_ccdt Build a Conforming Constrained Delaunay Triangulation The following example shows how to use the helper constructor function `make_conforming_constrained_Delaunay_triangulation_3()` to create a @@ -121,7 +121,7 @@ conforming constrained Delaunay triangulation from a given PLC. \cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3.cpp } -\subsection CT_3_example_ccdt_soup Build a conforming constrained Delaunay triangulation from a polygon soup +\subsection CT_3_example_ccdt_soup Build a Conforming Constrained Delaunay Triangulation from a Polygon Soup It is also possible to create a conforming constrained Delaunay triangulation from a polygon soup, i.e., a set of polygons for which the connectivity is not known a priori. @@ -130,7 +130,7 @@ This example shows an example of building such a triangulation. \cgalExample{Constrained_triangulation_3/conforming_constrained_Delaunay_triangulation_3_from_soup.cpp } -\subsection CT_3_example_ccdt_fpmap Build a conforming constrained Delaunay triangulation with known face patches +\subsection CT_3_example_ccdt_fpmap Build a Conforming Constrained Delaunay Triangulation with Known Face Patches When the user knows a priori the set of patch ids that he wants to attach to faces, this information can be used and kept valid through the construction of the conforming constrained @@ -152,7 +152,7 @@ Figure \cgalFigureRef{ccdt_fpmap} shows the input and output of this triangulati -\subsection CT_3_example_remesh Remeshing a conforming constrained Delaunay triangulation +\subsection CT_3_example_remesh Remeshing a Conforming Constrained Delaunay Triangulation Once the triangulation is built, it is possible to remesh it using the `CGAL::tetrahedral_isotropic_remeshing()` function from the \ref PkgTetrahedralRemeshing package,