later > latter

Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h

@@ -113,7 +113,7 @@ locate(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    *
    * If the type Bgt2 is the same as the type Gt2, use a reference to Gt2
    * to avoid constructing a new one.  Otherwise, instantiate a local variable
-   * of the former and provide the later as a single parameter to the
+   * of the former and provide the latter as a single parameter to the
    * constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has

Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h

@@ -241,7 +241,7 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
    * If the type Ovl_gt2 is the same as the type
    * GeomTraits, use a reference to GeomTraits to avoid constructing a new one.
    * Otherwise, instantiate a local variable of the former and provide
-   * the later as a single parameter to the constructor.
+   * the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).

Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h

@@ -117,7 +117,7 @@ decompose(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    *
    * If the type Vgt2 is the same as the type Gt2, use a
    * reference to Gt2 to avoid constructing a new one.  Otherwise,
-   * instantiate a local variable of the former and provide the later as a
+   * instantiate a local variable of the former and provide the latter as a
    * single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has

Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h

@@ -264,7 +264,7 @@ insert_empty(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    * If the type C_visitor::Geometry_traits_2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
@@ -319,7 +319,7 @@ void insert_empty(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>&
    * If the type C_visitor::Geometry_traits_2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
@@ -372,7 +372,7 @@ void insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
    * If the type Igt2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
@@ -972,7 +972,7 @@ non_intersecting_insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
    * If the type Nxi_visitor::Geometry_traits_2 is the same as the type
    * GeometryTraits_2, use a reference to GeometryTraits_2 to avoid constructing
    * a new one.  Otherwise, instantiate a local variable of the former and
-   * provide the later as a single parameter to the constructor.
+   * provide the latter as a single parameter to the constructor.
    *
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).

Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h

@@ -47,7 +47,7 @@ namespace CGAL {
     //
     //    E* = { y | (y - c)^T M'/alpha (y - c) + mu <= 0 }.
     //
-    // Expanding the later and comparing with the original form we
+    // Expanding the latter and comparing with the original form we
     // obtain
     //
     //    c = - M'^{-1} m

Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt

@@ -268,7 +268,7 @@ as follows:
 A note on performance: The algorithm sorts and partitions the input
 sequences. It is clearly costly to copy a large box compared to a
 simple pointer. However, the algorithm benefits from memory locality
-in the later stages when it copies the boxes, while the pointers would
+in the latter stages when it copies the boxes, while the pointers would
 refer to boxes that become wildly scattered in memory. These two
 effects, copying costs and memory locality, counteract each other. For
 small box sizes, i.e., small dimension, memory locality wins and one

Documentation/doc/resources/1.10.0/BaseDoxyfile.in

@@ -222,7 +222,7 @@ ALIASES                = "cgal=%CGAL" \
 # language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
 # Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
 # VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
-# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# FortranFree, unknown formatted Fortran: Fortran. In the latter case the parser
 # tries to guess whether the code is fixed or free formatted code, this is the
 # default for Fortran type files). For instance to make doxygen treat .inc files
 # as Fortran files (default is PHP), and .f files as C (default is Fortran),

Documentation/doc/resources/1.8.13/BaseDoxyfile.in

@@ -213,7 +213,7 @@ ALIASES                = "cgal=%CGAL" \
 # language is one of the parsers supported by doxygen: IDL, Java, Javascript,
 # C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
 # FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
-# Fortran. In the later case the parser tries to guess whether the code is fixed
+# Fortran. In the latter case the parser tries to guess whether the code is fixed
 # or free formatted code, this is the default for Fortran type files), VHDL. For
 # instance to make doxygen treat .inc files as Fortran files (default is PHP),
 # and .f files as C (default is Fortran), use: inc=Fortran f=C.

Documentation/doc/resources/1.9.6/BaseDoxyfile.in

@@ -222,7 +222,7 @@ ALIASES                = "cgal=%CGAL" \
 # language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
 # Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
 # VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
-# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# FortranFree, unknown formatted Fortran: Fortran. In the latter case the parser
 # tries to guess whether the code is fixed or free formatted code, this is the
 # default for Fortran type files). For instance to make doxygen treat .inc files
 # as Fortran files (default is PHP), and .f files as C (default is Fortran),

Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h

@@ -1697,7 +1697,7 @@ compute_facet_properties(const Facet& facet,
 #ifdef CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
       // In the following, std::get<2>(intersect) == 0 is a way to
       // test "intersect == Intersection()" (aka empty intersection), but
-      // the later does not work.
+      // the latter does not work.
       Surface_patch surface =
         (dimension(intersect) == 0) ? Surface_patch() :
         Surface_patch(

Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt

@@ -669,7 +669,7 @@ of the offset approximation for degenerate polygons such as line segments. This
 enhancement was developed by Efi Fogel, who also developed a new decomposition
 strategy, which can handle polygons with holes, essentially enabling the
 computation of Minkowski sum of two polygons with holes using the decomposition
-approach. The later was introduced with release 4.6. Ron Wein, Efi Fogel,
+approach. The latter was introduced with release 4.6. Ron Wein, Efi Fogel,
 Ophir Setter, Andreas Fabri, and Laurent Rineau helped maintaining the package
 applying bug fixes and other improvements. In particular, Andreas Fabri and
 Laurent Rineau helped tracing and solving several bugs in the approximated

Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h

@@ -46,7 +46,7 @@ public:
   void before_edge_split(halfedge_descriptor h, const Triangle_mesh& tm);
   /// called when a new split is done. The target of `hnew` is a new split vertex. There is only one call per edge.
   void edge_split(halfedge_descriptor hnew, const Triangle_mesh& tm);
-  /// called when the split of the halfedge `h` passed at the later call to `before_edge_split()` is finished.
+  /// called when the split of the halfedge `h` passed at the latter call to `before_edge_split()` is finished.
   void after_edge_split();
   ///  called when a new edge has been added to triangulate a face. The face triangulated is `f_split`
   ///  in the last call to `before_subface_creations(f_split, tm)`. There is only one call per edge.

Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h

@@ -26,7 +26,7 @@ contour offset instead of two contour offsets, one of them corresponding to the
 
 Simply using `2*offset` as the separation is incorrect since `offset` is the distance
 between an offset line and its original, not between an offset vertex and its original.
-The later, which is calculated by this function and needed to place the frame sufficiently
+The latter, which is calculated by this function and needed to place the frame sufficiently
 away from the polygon, can be thousands of times larger than `offset`.
 
 If the result is <I>absent</I>, any attempt to construct an exterior offset polygon at distance `offset` will fail.