issue #8515 Spelling mistakes found checking en-GB to en-US

Spelling corrections, `en-GB` -> `en-US`

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h

@@ -1496,7 +1496,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   std::string mode = "parallel";
 #endif
 
-// It might be possible to optimise the hardcoded value below
+// It might be possible to optimize the hardcoded value below
 // but the less triangles the faster will anyway be the operation.
 // So it's probably not critical.
 #ifdef CGAL_LINKED_WITH_TBB

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h

@@ -619,7 +619,7 @@ compute_vertex_normal_as_sum_of_weighted_normals(typename boost::graph_traits<Po
 * \brief computes the unit normal at vertex `v` as a function of the normals of incident faces.
 *
 * The implementation is inspired by Aubry et al. "On the most 'normal' normal" \cgalCite{cgal:al-otmnn-08},
-* which aims to compute a normal that maximises the visibility to the incident faces.
+* which aims to compute a normal that maximizes the visibility to the incident faces.
 * If such normal does not exist or if the optimization process fails to find it, a fallback normal is computed
 * as a sine-weighted sum of the normals of the incident faces.
 *

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h

@@ -1485,7 +1485,7 @@ bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm1,
   TM1_hd_traits traversal_traits_tm1(tm2_tree, tm1, tm2, vpm1, vpm2,
                                      infinity_value, sq_initial_bound, sq_distance_bound);
 
-  // Find candidate triangles in TM1, which might realise the Hausdorff bound.
+  // Find candidate triangles in TM1, which might realize the Hausdorff bound.
   // We build a sorted structure while collecting the candidates.
   const Point_3 stub(0, 0, 0); // dummy point given as query since it is not needed
 

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Ray_3_Triangle_3_traversal_traits.h

@@ -150,7 +150,7 @@ public:
       //check if the ray source is above or below the triangle and compare it
       //with the direction of the ray
       //TODO and if yes return
-      //this is just an optimisation, the current code is valid
+      //this is just an optimization, the current code is valid
 
       this->m_status.first=boost::logic::indeterminate;
       this->m_stop=true;

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h

@@ -582,7 +582,7 @@ struct Filter_wrapper_for_cap_needle_removal<TriangleMesh, VPM, Traits, Identity
 ///   \cgalParamNBegin{filter}
 ///     \cgalParamDescription{A function object providing `bool operator()(geom_traits::Point_3,geom_traits::Point_3,geom_traits::Point_3)`.}
 ///     \cgalParamType{The function object is queried each time a new triangle is about to be created by a flip or a collapse operation.
-///                    If `false` is returned, the operation is cancelled.}
+///                    If `false` is returned, the operation is canceled.}
 ///     \cgalParamDefault{a functor always returning `true`.}
 ///   \cgalParamNEnd
 /// \cgalNamedParamsEnd