Spelling correction

Spelling correction due to updated dictionary.
(dictionary was updated after the previous spelling correction :-( )

Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h

@@ -1191,7 +1191,7 @@ private:
 
     if(refining)
     {
-      // If we are re-using the triangulation, change the label of the extra elements
+      // If we are reusing the triangulation, change the label of the extra elements
       // that we have added to ensure a manifold result back to external ("manifold" -> "outside")
       reset_manifold_labels();
 

Combinatorial_map/include/CGAL/Combinatorial_map.h

@@ -3716,7 +3716,7 @@ namespace CGAL {
 
     /** Create an edge.
      * if closed==true, the edge has no 2-free dart.
-     * (note that for CMap there is no differente between true and false, but
+     * (note that for CMap there is no difference between true and false, but
      *  this is not the case for GMap)
      * @return a dart of the new edge.
      */
@@ -3733,7 +3733,7 @@ namespace CGAL {
      * @param h0 the first vertex descriptor.
      * @param h1 the second vertex descriptor.
      * if closed==true, the edge has no 2-free dart.
-     * (note that for CMap there is no differente between true and false, but
+     * (note that for CMap there is no difference between true and false, but
      *  this is not the case for GMap)
      * @return the dart of the new edge incident to h0.
      */

HalfedgeDS/doc/HalfedgeDS/HalfedgeDS.txt

@@ -172,7 +172,7 @@ in a consistent, i.e., <I>valid</I>, state.
 
 \subsection HalfedgeDSExampleAddingColortoFaces Example Adding Color to Faces
 
-This example re-uses the base class available for faces and adds a
+This example reuses the base class available for faces and adds a
 member variable `color`.
 
 \cgalExample{HalfedgeDS/hds_prog_color.cpp}

Heat_method_3/doc/Heat_method_3/Heat_method_3.txt

@@ -22,7 +22,7 @@ as a gradient red/green corresponding to close/far from the source vertices.
 The heat method is highly efficient, since the algorithm
 boils down to two standard sparse linear algebra problems.  It is especially
 useful in situations where one wishes to perform repeated distance queries
-on a fixed domain, since precomputation done for the first query can be re-used.
+on a fixed domain, since precomputation done for the first query can be reused.
 
 As a rule of thumb, the method works well on triangle meshes, which are
 Delaunay, though in practice may also work fine for meshes that are far from

Installation/CHANGES.md

@@ -3364,7 +3364,7 @@ Release date: October 2013
 #### CGAL and Boost Property Maps
 
 -   The `key_type` of the property maps provided by CGAL used to be an
-    iterator. In order to be more easily re-used, the `key_type` has
+    iterator. In order to be more easily reused, the `key_type` has
     been changed to be the `value_type` of the iterator. The packages
     that have been updated to match these changes are **Point Set
     Processing** and **Surface Reconstruction from Point Sets**.

Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h

@@ -2614,7 +2614,7 @@ update_mesh_topo_change(const Vertex_handle& old_vertex,
      std::cerr << "update_mesh_topo_change: revert move to " << old_position << "\n";
 #endif
 
-    //reset caches in case cells are re-used by the compact container
+    //reset caches in case cells are reused by the compact container
     reset_circumcenter_cache(outdated_cells);
     reset_sliver_cache(outdated_cells);
     outdated_cells.clear();

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h

@@ -2185,7 +2185,7 @@ remove_self_intersections_one_step(std::set<typename boost::graph_traits<Triangl
     // If smoothing fails, the face patch is restored to its pre-smoothing state.
     //
     // There is no need to update the working range because smoothing doesn`t change
-    // the number of faces (and old faces are re-used).
+    // the number of faces (and old faces are reused).
     //
     // Do not smooth if there are no self-intersections within the patch: this means the intersection
     // is with another CC and smoothing is unlikely to move the surface sufficiently

STL_Extension/include/CGAL/Time_stamper.h

@@ -42,7 +42,7 @@ struct Time_stamper
       pt->set_time_stamp(new_ts);
     }
     else {
-      // else: the time stamp is re-used
+      // else: the time stamp is reused
 
       // Enforces that the time stamp is greater than the current value.
       // That is used when a TDS_3 is copied: in that case, the

Triangulation_3/doc/Triangulation_3/Triangulation_3.txt

@@ -333,7 +333,7 @@ Prior to \cgal 3.6, this functionality was available through the
 
 In order to satisfy as many uses as possible, a design has been selected that
 allows to exchange different parts to meet the users' needs, while still
-re-using a maximum of the provided functionalities. We have already seen that
+reusing a maximum of the provided functionalities. We have already seen that
 the main triangulation classes are parameterized by a geometric traits class
 and a triangulation data structure (TDS), so that each of them can be
 interchanged with alternate implementations.