reorganize the doc (Mael's review)

Author: lrineau

Constrained_triangulation_3/doc/Constrained_triangulation_3/Constrained_triangulation_3.txt

@@ -93,14 +93,8 @@ A Schönhardt polyhedron. The non-convex edges are shown in bold.
 Shewchuk \cgalCite{cgal:shewchuk1998condition} demonstrated that for any PLC, there exists a refined
 version of the original PLC that admits a constrained Delaunay triangulation. This refinement is
 achieved by adding Steiner vertices to the input edges and polygons. The constrained triangulation
-built on this refined PLC is known as a _conforming constrained Delaunay triangulation_ (CCDT for short).
-
-The algorithm implemented in this package is based on the work of Hang Si, who developed particular
-algorithms for constructing conforming constrained Delaunay triangulations from PLCs, with floating
-point numbers as coordinates
-\cgalCite{si2005meshing}, \cgalCite{cgal:si2008cdt3}, \cgalCite{si2015tetgen}.
-
-\cgalFigureRef{CT_3_plc2cdt_fig} illustrates an example of a conforming constrained
+built on this refined PLC is known as a _conforming constrained Delaunay triangulation_ (CCDT for
+short). \cgalFigureRef{CT_3_plc2cdt_fig} illustrates an example of a conforming constrained
 Delaunay triangulation constructed from a PLC.
 
 \cgalFigureAnchor{CT_3_plc2cdt_fig}
@@ -112,6 +106,11 @@ Left: PLC (360 vertices);
 Right: CCDT (2452 vertices).
 \cgalFigureCaptionEnd
 
+The algorithm implemented in this package is based on the work of Hang Si, who developed particular
+algorithms for constructing conforming constrained Delaunay triangulations from PLCs, with floating
+point numbers as coordinates
+\cgalCite{si2005meshing}, \cgalCite{cgal:si2008cdt3}, \cgalCite{si2015tetgen}.
+
 
 \section CT_3_design Software Design