spelling corrections

Some spelling corrections (Directories starting with `O`-`S` , first part),
some backward work
some forward work

Author: albert-github

Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_constructions.h

@@ -88,7 +88,7 @@ void _test_circle_construct(CK ck)
                 assert(cp_y_min.y() < cp_y_max.y());
   }
 
-  //Constuct_intersections_2 with 2 intersection's points
+  //Construct_intersections_2 with 2 intersection's points
   std::cout << std::endl << "construct_intersection_2" << std::endl;
   Do_intersect_2 theDo_intersect_2 = ck.do_intersect_2_object();
   Intersect_2 theConstruct_intersect_2
@@ -131,7 +131,7 @@ void _test_circle_construct(CK ck)
   Compare_xy_2 theCompare_xy_2 = ck.compare_xy_2_object();
   assert(theCompare_xy_2(first, second) == CGAL::SMALLER);
 
-  //Constuct_intersections_2 with 1 intersection's point
+  //Construct_intersections_2 with 1 intersection's point
   Point_2 center_circ_intersections_2_3(center_circ_intersection_2_1_x
                                         + 2 * circ_intersection_2_1_r,
                                         center_circ_intersection_2_1_y);

Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h

@@ -207,7 +207,7 @@ class Polyhedral_mesh_domain_3
   }
 
   /**
-   * @brief Constructor. Contruction from a polyhedral surface
+   * @brief Constructor. Construction from a polyhedral surface
    * @param polyhedron the polyhedron describing the polyhedral surface
    */
   Polyhedral_mesh_domain_3(const Polyhedron& p,

Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/evolution.h

@@ -129,7 +129,7 @@ class Evolution
               const std::size_t nelder_mead_iterations,
               const std::size_t max_random_mutations = 0)
   {
-    // stopping criteria prameters
+    // stopping criteria parameters
     FT prev_fit_value = 0;
     const FT tolerance = 1e-10;
     int stale = 0;

Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h

@@ -230,11 +230,11 @@ class Optimal_transportation_reconstruction_2
 
   /// @}
 
-  /// \name Settting Parameters
+  /// \name Setting Parameters
   /// @{
   /*!
           If `sample_size == 0`, the simplification is performed using an exhaustive priority queue.
-          If `sample_size` is stricly positive the simplification is performed using a
+          If `sample_size` is strictly positive the simplification is performed using a
           multiple choice approach, ie, a best-choice selection in a random sample of
           edge collapse operators, of size `sample_size`. A typical value for the sample
           size is 15, but this value must be enlarged when targeting a very coarse simplification.

Orthtree/include/CGAL/Orthtree/Node.h

@@ -365,7 +365,7 @@ class Orthtree<Traits, PointRange, PointMap>::Node
   }
 
   /*!
-    \brief returns the nth child fo this node.
+    \brief returns the nth child of this node.
 
     \pre `!is_null()`
     \pre `!is_leaf()`

Partition_2/include/CGAL/Partition_2/Rotation_tree_2.h

@@ -107,7 +107,7 @@ class Rotation_tree_2 : public internal::vector< Rotation_tree_node_2<Traits_> >
 
 
    // the point that comes first in the right-to-left ordering is first
-   // in the ordering, after the auxilliary points p_minus_inf and p_inf
+   // in the ordering, after the auxiliary points p_minus_inf and p_inf
    Self_iterator rightmost_point_ref()
    {
       return this->begin();

Partition_2/include/CGAL/Partition_2/partition_y_monotone_2.h

@@ -11,7 +11,7 @@
 // Author(s)     : Susan Hert <[email protected]>
 
 //
-// Implementaion of the algorithm from pp 49--55 of "Computational Geometry
+// Implementation of the algorithm from pp 49--55 of "Computational Geometry
 // Algorithms and  Applications" by de Berg, van Kreveld, Overmars, and
 // Schwarzkopf for producing a partitioning of a polygon into y-monotone
 // pieces.

Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h

@@ -572,7 +572,7 @@ class Periodic_2_Delaunay_triangulation_2
   void propagating_flip(const Face_handle& f, int i);
 #endif
 
-  // auxilliary functions for remove
+  // auxiliary functions for remove
   // returns false if we first need to convert to a 9-cover before the vertex can be removed
   bool remove_single_vertex(Vertex_handle v, const Offset &v_o);
   void remove_degree_triangulate(Vertex_handle v, std::vector<Face_handle> &f,
@@ -763,7 +763,7 @@ class Periodic_2_Delaunay_triangulation_2
                                    true) ==  ON_POSITIVE_SIDE;
   }
 
-// end of auxilliary functions for remove
+// end of auxiliary functions for remove
 
 
 

Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_hierarchy_2.h

@@ -209,7 +209,7 @@ Periodic_2_triangulation_hierarchy_2(const Periodic_2_triangulation_hierarchy_2<
 }
 
 
-//Assignement
+//Assignment
 template <class PTr>
 Periodic_2_triangulation_hierarchy_2<PTr> &
 Periodic_2_triangulation_hierarchy_2<PTr>::

Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h

@@ -1155,7 +1155,7 @@ try_to_remove_close_dummy_vertex(Vertex_handle& protection_vertex,
          protection_vertex, weight, is_special(protection_vertex), dummy_point))
     {
 #if CGAL_MESH_3_PROTECTION_DEBUG & 4
-      std::cerr << "Successfuly removed the dummy point and changed the vertex weight" << std::endl;
+      std::cerr << "Successfully removed the dummy point and changed the vertex weight" << std::endl;
 #endif
       return true;
     }
@@ -1657,7 +1657,7 @@ smart_insert_point(const Bare_point& p, Weight w, int dim, const Index& index,
     }
     else
     {
-      // The corner has already been inserted and necessary adjustements to its weight
+      // The corner has already been inserted and necessary adjustments to its weight
       // have already been performed during its insertion and during the insertion
       // of other points. Only thing missing is to add it the correspondence map.
       insert_in_correspondence_map(v, p, curve_indices);
@@ -1884,7 +1884,7 @@ insert_balls_on_edges()
   Input_features input_features;
   domain_.get_curves(std::back_inserter(input_features));
 
-  // Interate on edges
+  // Iterate on edges
   for(typename Input_features::iterator fit = input_features.begin(),
        end = input_features.end() ; fit != end ; ++fit)
   {

Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_triangulation_3.h

@@ -49,7 +49,7 @@
 
 namespace CGAL {
 
-/// This class currently provides an interface between the classe
+/// This class currently provides an interface between the class
 /// `CGAL::Periodic_3_regular_triangulation_3` and the mesher `Mesh_3`.
 /// As periodic triangulations are parallelized, a lot of these functions will
 /// become obsolete.

Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/Scene.cpp

@@ -1,4 +1,4 @@
-//The function project() is a modified version of the function gluProject(),whcich license is :
+//The function project() is a modified version of the function gluProject(),which license is :
 /*
  * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
  * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.

Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt

@@ -33,7 +33,7 @@ if(CGAL_Qt5_FOUND
 
   include_directories(BEFORE ./)
 
-  # ui file, created wih Qt Designer
+  # ui file, created with Qt Designer
   qt5_wrap_ui(uis MainWindow.ui)
 
   # qrc files (resources files, that contain icons, at least)

Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h

@@ -177,11 +177,11 @@ class Periodic_3_regular_triangulation_3
   };
 
   /// This threshold is chosen such that if all orthosphere radii are shorter
-  /// than this treshold, then we can be sure that there are no self-edges anymore.
+  /// than this threshold, then we can be sure that there are no self-edges anymore.
   FT orthosphere_radius_threshold;
 
   /// This container stores all the cells whose orthosphere radius is larger
-  /// than the treshold `orthosphere_radius_threshold`.
+  /// than the threshold `orthosphere_radius_threshold`.
   boost::unordered_set<Cell_handle, Cell_handle_hash> cells_with_too_big_orthoball;
 
   class Cover_manager

Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h

@@ -680,7 +680,7 @@ class Periodic_3_triangulation_3
   // ---------------------------------------------------------------------------
   // The following functions return objects of type Point and Periodic_point,
   // _not_ Point_3 and Periodic_point_3.
-  // They are templated by `construct_point` to distingush between Delaunay and
+  // They are templated by `construct_point` to distinguish between Delaunay and
   // regular triangulations
   // ---------------------------------------------------------------------------
 
@@ -3332,7 +3332,7 @@ periodic_remove(Vertex_handle v, PointRemover& remover, CoverManager& cover_mana
   _tds.delete_vertex(v);
   _tds.delete_cells(hole.begin(), hole.end());
   CGAL_expensive_assertion(is_valid());
-  return true; // sucessfully removed the vertex
+  return true; // successfully removed the vertex
 }
 
 // ############################################################################

Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_alpha_shape_3.h

@@ -71,10 +71,10 @@ _test_cls_alpha_shape_3()
 
   if(verbose) {
     std::cerr << " optimal de 1 " << *opt
-              << "nb of componants " << a1.number_of_solid_components(*opt)
+              << "nb of components " << a1.number_of_solid_components(*opt)
               << std::endl;
     std::cerr << " previous " << *previous
-              << "nb of componants "
+              << "nb of components "
               << a1.number_of_solid_components(*previous) << std::endl;
   }
   assert(a1.number_of_solid_components(*opt) == 1);

Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/test_p3rt3_versus_rt3.cpp

@@ -20,7 +20,7 @@
 #include <vector>
 
 // A basic test to check that P3RT3 and RT3 produces the same regular triangulations
-// In the case of RT3, a fake periodicity is obtained by addding 26 copies
+// In the case of RT3, a fake periodicity is obtained by adding 26 copies
 // of the same input point set (similarly to how we copy in P3RT3 when it cannot
 // yet be converted to 1 sheet) around the cube.
 

Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h

@@ -203,7 +203,7 @@ MainWindow::animate() {
         break;
       }
     }
-    //std::cout << "  DONE! " << (found ? "Fount it!" : "Didn't find it!") << std::endl;
+    //std::cout << "  DONE! " << (found ? "Found it!" : "Didn't find it!") << std::endl;
 
 
     // If the correct translation is NOT one of the generators, it will

Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Hyperbolic_octagon_translation.h

@@ -19,7 +19,7 @@ A translation \f$g\f$ in \f$\mathcal G\f$ is a mapping acting on the hyperbolic
 \f$\mathbb H^2\f$. It has the form
 \f[ g(z) = \frac{ \alpha\cdot z + \beta }{ \overline{\beta}\cdot z + \overline{\alpha} }, \qquad
         \alpha,\beta \in \mathbb C, \qquad z \in \mathbb H^2, \qquad |\alpha|^2 - |\beta|^2 = 1, \f]
-where \f$\overline{\alpha}\f$ ane \f$\overline{\beta}\f$ are the complex conjugates of
+where \f$\overline{\alpha}\f$ and \f$\overline{\beta}\f$ are the complex conjugates of
 \f$\alpha\f$ and \f$\beta\f$ respectively. In this implementation, the translation \f$g\f$
 is uniquely defined by its coefficients \f$\alpha\f$ and \f$\beta\f$.
 

Point_set_2/include/CGAL/range_search_delaunay_2.h

@@ -204,7 +204,7 @@ OutputIterator range_search(Dt& delau,
 // and then performs a range query with this circle.
 // When vertices of the trinagulation are on the circle the outcome
 // is not deterministic.
-// A solution would be to not constuct a circle, but to use the
+// A solution would be to not construct a circle, but to use the
 // function CGAL::side_of_bounded_circle
 
 template<class Dt, class OutputIterator>

Point_set_3/doc/Point_set_3/PackageDescription.txt

@@ -11,13 +11,13 @@
 /// \defgroup PkgPointSet3IO Input/Output
 /// \ingroup PkgPointSet3Ref
 ///
-/// This module offers convenience overloads of input/ouput
+/// This module offers convenience overloads of input/output
 /// functions available in the \ref PkgPointSetProcessing3 package.
 /// These overloads, available after including `CGAL/Point_set_3/IO.h`,
 /// allow the user to call point set processing algorithms without having
 /// to handle manually property maps and iterators.
 ///
-/// Input functions instanciate all the necessary property maps:
+/// Input functions instantiate all the necessary property maps:
 ///
 /// - if found in the input, normal vectors are stored in the usual
 /// `CGAL::Point_set_3` property `normal` with template type `Vector`
@@ -77,7 +77,7 @@
 
 \cgalCRPSection{I/O Functions}
 This package offers convenience overloads for the class `CGAL::Point_set_3`
-of the input/ouput functions available in the \ref PkgPointSetProcessing3 package.
+of the input/output functions available in the \ref PkgPointSetProcessing3 package.
 These overloads, available after including `CGAL/Point_set_3/IO.h`,
 allow the user to call point set processing algorithms without having
 to handle manually property maps and iterators.

Point_set_3/include/CGAL/Point_set_3.h

@@ -963,8 +963,8 @@ class Point_set_3
     - `geom_traits`: contains the kernel `typename Kernel_traits<Point>`::`Kernel`
 
     \warning this method does not check if the normal map was
-    instanciated or not. The normal map named parameter should not be
-    used if this property was not instanciated first.
+    instantiated or not. The normal map named parameter should not be
+    used if this property was not instantiated first.
   */
 #ifdef DOXYGEN_RUNNING
   unspecified_type

Point_set_3/include/CGAL/Point_set_3/IO/LAS.h

@@ -52,7 +52,7 @@ void check_if_property_is_used(PointSet& point_set,
 /*!
   \ingroup PkgPointSet3IOLAS
 
-  \brief reads the content of an intput stream in the \ref IOStreamLAS into a point set.
+  \brief reads the content of an input stream in the \ref IOStreamLAS into a point set.
 
   \attention To read a binary file, the flag `std::ios::binary` must be set during the creation of the `ifstream`.
 
@@ -147,7 +147,7 @@ bool read_LAS(std::istream& is,
 /*!
   \ingroup PkgPointSet3IOLAS
 
-  \brief reads the content of an intput file in the \ref IOStreamLAS into a point set.
+  \brief reads the content of an input file in the \ref IOStreamLAS into a point set.
 
   \param fname the path to the input file
   \param point_set the point set

Point_set_3/include/CGAL/Point_set_3/IO/OFF.h

@@ -36,7 +36,7 @@ namespace IO {
 /*!
   \ingroup PkgPointSet3IOOFF
 
-  \brief reads the content of an intput stream in the \ref IOStreamOFF into a point set.
+  \brief reads the content of an input stream in the \ref IOStreamOFF into a point set.
 
   If normals are present in the input (NOFF), a normal map will be created and filled.
 

Point_set_3/include/CGAL/Point_set_3/IO/XYZ.h

@@ -35,7 +35,7 @@ namespace IO {
 /*!
   \ingroup PkgPointSet3IOXYZ
 
-  \brief reads the content of an intput stream in the \ref IOStreamXYZ into a point set.
+  \brief reads the content of an input stream in the \ref IOStreamXYZ into a point set.
 
   If normals are present in the input stream, a normal map will be created and filled.
 

Point_set_processing_3/examples/Point_set_processing_3/property_map.cpp

@@ -53,7 +53,7 @@ void process_point_set(Iterator beg, Iterator end, PointPMap pmap)
   std::sort(beg,end,less);
 }
 
-// We can call it just with points. Then interally we use a property map
+// We can call it just with points. Then internally we use a property map
 // that maps point iterators on points.
 
 template <typename Iterator>

Point_set_processing_3/include/CGAL/IO/write_las_points.h

@@ -164,7 +164,7 @@ namespace LAS {
    handlers. A `PropertyHandle` is a `std::pair<PropertyMap,
    LAS_property::Tag >` used to write a scalar value
    `LAS_property::Tag::type` as a %LAS property (for example,
-   writing an `int` vairable as an `int` %LAS property). An exception
+   writing an `int` variable as an `int` %LAS property). An exception
    is used for points that are written using a `std::tuple` object.
 
    See documentation of `read_LAS_with_properties()` for the

Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h

@@ -276,7 +276,7 @@ compute_registration_transformation(const PointRange1& range1,    const PointRan
      \cgalParamNEnd
 
      \cgalParamNBegin{normal_map}
-       \cgalParamDescription{a property map associating normals to the elements of the poing set `point_set_2`}
+       \cgalParamDescription{a property map associating normals to the elements of the point set `point_set_2`}
        \cgalParamType{a model of `ReadablePropertyMap` whose key type is the value type
                       of the iterator of `PointRange2` and whose value type is `geom_traits::Vector_3`}
        \cgalParamDefault{Normals are computed and stored internally.}

Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h

@@ -196,7 +196,7 @@ register_point_sets(const PointRange1& range1,    PointRange2& range2,
      \cgalParamNEnd
 
      \cgalParamNBegin{normal_map}
-       \cgalParamDescription{a property map associating normals to the elements of the poing set `point_set_2`}
+       \cgalParamDescription{a property map associating normals to the elements of the point set `point_set_2`}
        \cgalParamType{a model of `ReadablePropertyMap` whose key type is the value type
                       of the iterator of `PointRange2` and whose value type is `geom_traits::Vector_3`}
        \cgalParamDefault{Normals are computed and stored internally.}

Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/Rich_grid.h

@@ -266,7 +266,7 @@ void Rich_grid<Kernel>::travel_itself(
       for(int x = 0; x < x_side; x++) {
         int origin = cell(x, y, z);
         self(get_start_iter(origin), get_end_iter(origin), radius);
-        // compute between other girds
+        // compute between other grids
         for(int d = 2; d < 28; d += 2) { // skipping self
           const int *cs = corner + 3*diagonals[d];
           const int *ce = corner + 3*diagonals[d+1];
@@ -284,7 +284,7 @@ void Rich_grid<Kernel>::travel_itself(
   }
 }
 
-/// define how to travel in other gird
+/// define how to travel in other grid
 template <typename Kernel>
 void Rich_grid<Kernel>::travel_others(
   Rich_grid &points,

Point_set_processing_3/include/CGAL/compute_average_spacing.h

@@ -181,7 +181,7 @@ compute_average_spacing(
   // precondition: at least 2 nearest neighbors
   CGAL_precondition(k >= 2);
 
-  // Instanciate a KD-tree search.
+  // Instantiate a KD-tree search.
   Neighbor_query neighbor_query (points, point_map);
 
   // iterate over input points, compute and output normal

Point_set_processing_3/include/CGAL/jet_smooth_point_set.h

@@ -223,7 +223,7 @@ jet_smooth_point_set(
   // precondition: at least 2 nearest neighbors
   CGAL_precondition(k >= 2);
 
-  // Instanciate a KD-tree search.
+  // Instantiate a KD-tree search.
   Neighbor_query neighbor_query (points, point_map);
 
   // Iterates over input points and mutates them.

Point_set_processing_3/include/CGAL/mst_orient_normals.h

@@ -156,7 +156,7 @@ class Default_constrained_map
 /// Helper class: Propagate_normal_orientation
 ///
 /// This class is used internally by mst_orient_normals()
-/// to propage the normal orientation, starting from a source point
+/// to propagate the normal orientation, starting from a source point
 /// and following the adjacency relations of vertices in a Minimum Spanning Tree.
 /// It does not orient normals that are already oriented.
 /// It does not propagate the orientation if the angle between 2 normals > angle_max.
@@ -548,7 +548,7 @@ create_mst_graph(
    \ingroup PkgPointSetProcessing3Algorithms
    Orients the normals of the range of `points` using the propagation
    of a seed orientation through a minimum spanning tree of the Riemannian graph.
-   This method modifies the order of input points so as to pack all sucessfully oriented points first,
+   This method modifies the order of input points so as to pack all successfully oriented points first,
    and returns an iterator over the first point with an unoriented normal (see erase-remove idiom).
    For this reason it should not be called on sorted containers.
    It is based on \cgalCite{cgal:hddms-srup-92}.