diff --git a/Documentation/doc/scripts/generate_how_to_cite.py b/Documentation/doc/scripts/generate_how_to_cite.py
index 21037011e54..7c407397a10 100644
--- a/Documentation/doc/scripts/generate_how_to_cite.py
+++ b/Documentation/doc/scripts/generate_how_to_cite.py
@@ -73,9 +73,7 @@ The \cgal Project.
"""
-RESULT_TXT_FOOTER = r"""
-
-
+RESULT_TXT_FOOTER = r"""
*/
"""
diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
old mode 100644
new mode 100755
index 848d4608ebb..5c6510ec396
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -456,8 +456,8 @@ behaves with respect to these parameters.
| |
|
-
|
+
 |
 |
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 86b73742fd6..2bded6d6373 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -969,7 +969,7 @@ sample_triangle_mesh(const TriangleMesh& tm,
* of the smallest non-null edge of the soup or the value passed to the named parameter
* `grid_spacing`.}
* \cgalParamNEnd
- * * \cgalParamNBegin{use_monte_carlo_sampling}
+ * \cgalParamNBegin{use_monte_carlo_sampling}
* \cgalParamDescription{if `true` is passed, points are generated randomly in each triangle.}
* \cgalParamType{Boolean}
* \cgalParamDefault{`false`}
diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index aa49555f82a..8e4c223939e 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -536,8 +536,8 @@ The program has been compiled with Microsoft Visual C++ 2013 in Release mode.
| Time (s) | 0.003 | 0.007 | 0.03 | 0.14 | 0.56 | 2.7 | 11.3 | 45 | 185 | 686 | 2390 |
| Memory (MB) | < 1 | < 1 | < 1 | 1 | 3 | 13 | 53 | 182 | 662 | 2187 | 7156 |
| Number of maximal simplices | 184 | 487 | 1,548 | 5,548 | 19,598 | 67,102 | 230,375 | 715,984 | 2,570,623 | 7,293,293 | 21,235,615 |
-| Number of convex hull facets | 14 | 66 | 308 | 1,164 | 4,410 | 16,974 | 57,589 | 238,406 | 670,545 | 2,574,326 | 8,603,589 |
- |
|
+| Number of convex hull facets | 14 | 66 | 308 | 1,164 | 4,410 | 16,974 | 57,589 | 238,406 | 670,545 | 2,574,326 | 8,603,589 |
+
|
\cgalFigureCaptionBegin{Triangulationfigbenchmarks100}
@@ -553,8 +553,8 @@ Performance of the insertion of 100 points in a Delaunay triangulation.
| Time (s) | 0.01 | 0.05 | 0.5 | 3.4 | 24 | 183 | 1365 |
| Memory (MB) | < 1 | < 1 | 2.7 | 14 | 81 | 483 | 2827 |
| Number of maximal simplices | 1,979 | 6,315 | 25,845 | 122,116 | 596,927 | 3,133,318 | 16,403,337 |
-| Number of convex hull facets | 19 | 138 | 963 | 6,184 | 41,135 | 241,540 | 1,406,797 |
- |
|
+| Number of convex hull facets | 19 | 138 | 963 | 6,184 | 41,135 | 241,540 | 1,406,797 |
+
|
\cgalFigureCaptionBegin{Triangulationfigbenchmarks1000}