Typos, spelling mistakes, sentence order...

Mesh_3/doc/Mesh_3/CGAL/Mesh_triangulation_3.h

@@ -12,8 +12,8 @@ for the 3D triangulation embedding the mesh.
 and defaults to `Kernel_traits<MD>::Kernel`.
 
 \tparam Concurrency_tag enables sequential versus parallel meshing and optimization algorithms.
-                        Possible values are `CGAL::Sequential_tag` (the default) and
-                        `CGAL::Parallel_tag`.
+                        Possible values are `Sequential_tag` (the default) and
+                        `Parallel_tag`.
 
 \tparam Vertex_base stands for a model of `MeshVertexBase_3`
 and defaults to `Mesh_vertex_base_3<Gt, MD>`.

Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h

@@ -132,19 +132,19 @@ invalidate this cache value.
 */
 void invalidate_circumcenter();
 
+/// Get the erase counter. 
 /// Only required by the parallel algoritms.
-/// Get the erase counter value. See `CGAL::Compact_container`
-/// for more details.
+/// See `CGAL::Compact_container` for more details.
 unsigned int get_erase_counter() const;
 
+/// Sets the erase counter. 
 /// Only required by the parallel algoritms.
-/// Set the erase counter value. See `CGAL::Compact_container`
-/// for more details.
+/// See `CGAL::Compact_container` for more details.
 void set_erase_counter(unsigned int c);
 
-/// Only required by the parallel algoritms.
-/// Increment the erase counter value. See `CGAL::Compact_container`
-/// for more details.
+/// Increments the erase counter.
+/// Only required by the parallel algoritms. 
+/// See `CGAL::Compact_container` for more details.
 void increment_erase_counter();
 /// @}
 

Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h

@@ -120,20 +120,19 @@ Vertex_handle previous_intrusive() const;
 */
 void set_previous_intrusive(Vertex_handle);
 
-
+/// Get the erase counter. 
 /// Only required by the parallel algoritms.
-/// Get the erase counter value. See `CGAL::Compact_container`
-/// for more details.
+/// See `CGAL::Compact_container` for more details.
 unsigned int get_erase_counter() const;
 
+/// Sets the erase counter. 
 /// Only required by the parallel algoritms.
-/// Set the erase counter value. See `CGAL::Compact_container`
-/// for more details.
+/// See `CGAL::Compact_container` for more details.
 void set_erase_counter(unsigned int c);
 
-/// Only required by the parallel algoritms.
-/// Increment the erase counter value. See `CGAL::Compact_container`
-/// for more details.
+/// Increments the erase counter.
+/// Only required by the parallel algoritms. 
+/// See `CGAL::Compact_container` for more details.
 void increment_erase_counter();
 /// @}
 

Mesh_3/doc/Mesh_3/Mesh_3.txt

@@ -55,7 +55,7 @@ the boundary and subdivision surface patches may form \cgalCite{cgal:cdl-pdma-07
 The Delaunay refinement is followed by a mesh optimization phase
 to remove slivers and provide a good quality mesh.
 
-Optionally, the meshing and optimizations algorithms support multi-core shared-memory 
+Optionally, the meshing and optimization algorithms support multi-core shared-memory 
 architectures to take advantage of available parallelism.
 
 \subsection Mesh_3InputDomain Input Domain
@@ -700,18 +700,18 @@ We set a time bound of 10s and a sliver bound of 10 degrees for the exuder.
 
 \cgalExample{Mesh_3/mesh_optimization_lloyd_example.cpp}
 
-\section Mesh_3Performances Performances
+\section Mesh_3Performances Performance
 
-We provide here some benchmarks of the performances of the mesh generation engine.
+We provide here some benchmarks of the performance of the mesh generation algorithms.
 
 \subsection Mesh_3DelaunayRefinement_1 Delaunay Refinement
 
 The computer used for benchmarking is a PC running Linux64 with two Intel Xeon CPU X5450 clocked at 3.00 GHz
 with 32GB of RAM. The program has been compiled with g++ v4.3.2 with the -O3 option. 
-Note that those benchmarks were obtained with the sequential version of the algorithm, 
-which does not take advantage of multi-core architectures. See next section for performances of parallel algorithms.
-
-Those benchmarks have been done using \cgal v3.8.
+These benchmarks have been done using \cgal v3.8.
+Note that these benchmarks were obtained with the sequential version of the algorithm, 
+which does not take advantage of multi-core architectures. See the next 
+section for performance of parallel algorithms.
 
 We study the refinement part of the mesh generation engine in this section. We
 give the CPU time (measured by `Timer`) using the 3 provided oracles. In all experiments, we produce well
@@ -1060,5 +1060,7 @@ Dobrina Boltcheva et al. \cgalCite{cgal:byb-mgmmi-09}, \cgalCite{cgal:-byb-fpdmg
 of 1-dimensional features was worked out by Laurent Rineau, Stéphane Tayeb
 and Mariette Yvinec. It appeared first in the release 3.8 of \cgal.
 
+In 2013, Clément Jamin made the meshing and optimization algorithms parallel
+on multi-core shared-memory architectures.
 */ 
 } /* namespace CGAL */