Merge pull request CGAL#8243 from albert-github/feature/bug_spell_202…

…40530

Spelling correction

Advancing_front_surface_reconstruction/examples/Advancing_front_surface_reconstruction/reconstruction_structured.cpp

@@ -126,7 +126,7 @@ int main (int argc, char* argv[])
 
   Efficient_ransac ransac;
   ransac.set_input(points);
-  ransac.add_shape_factory<Plane>(); // Only planes are useful for stucturing
+  ransac.add_shape_factory<Plane>(); // Only planes are useful for structuring
 
   // Default RANSAC parameters
   Efficient_ransac::Parameters op;

Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h

@@ -1811,7 +1811,7 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
      * An x-critical point (x,y) of \c f (or its induced curve)
      * satisfies f(x,y) = f_y(x,y) = 0,
      * where f_y means the derivative w.r.t. y.
-     * In pariticular, each singular point is x-critical.
+     * In particular, each singular point is x-critical.
      */
     class X_critical_points_2 :
         public CGAL::cpp98::binary_function< Curve_analysis_2,
@@ -1890,7 +1890,7 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
      * An y-critical point (x,y) of \c f (or its induced curve)
      * satisfies f(x,y) = f_x(x,y) = 0,
      * where f_x means the derivative w.r.t. x.
-     * In pariticular, each singular point is y-critical.
+     * In particular, each singular point is y-critical.
      */
     class Y_critical_points_2 :
         public CGAL::cpp98::binary_function< Curve_analysis_2,

Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h

@@ -1153,7 +1153,7 @@ class Bitstream_descartes
   /*!
    * \brief Constructor for a polynomial \c f
    *
-   * See the documentation of the constrctor
+   * See the documentation of the constructor
    * with \c Square_free_descartes_tag
    */
   Bitstream_descartes(Polynomial f,

Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h

@@ -135,7 +135,7 @@ class Status_line_CA_1_rep {
     //! curve has vertical line at this x-coordinate
     mutable bool _m_vertical_line;
 
-    //! decsribes an event
+    //! describes an event
     mutable bool _m_event;
 
     //! number of arcs running down the pole

Algebraic_kernel_d/test/Algebraic_kernel_d/Algebraic_real_d_1.cpp

@@ -268,7 +268,7 @@ void algebraic_number_test()
 
     //simplify
     {
-        // just a synatx check
+        // just a syntax check
         Algebraic_real_d_1(P_s2510,1,2).simplify();
     }
 }

Apollonius_graph_2/include/CGAL/Apollonius_graph_2/compare_quadratic.h

@@ -31,7 +31,7 @@ namespace ApolloniusGraph_2 {
 
 
 //--------------------------------------------------------------------
-// help functions for the compulation of various quantites
+// help functions for the compulation of various quantities
 
 template < class FT >
 inline FT

Arrangement_on_surface_2/TODO

@@ -4,7 +4,7 @@
     another chapter on "2D Arrangements on General Surfaces".
     This chapter can be much shorter, as all you can do with arrangements was
     explained and demonstrated in the "2D Arrangements" chapter. We should
-    however intorduce the concept of TopologyTraits, and re-interpret the
+    however introduce the concept of TopologyTraits, and re-interpret the
     functionality of the GeometryTraits.
 
   - Incoorporate:
@@ -98,7 +98,7 @@
   - The "planar" zone visitor is also used here. I believe this should work,
     as it is generic enough (I hope).
     Can you test it by trying to incrementally insert curves to an
-    arrrangement on a sphere.
+    arrangement on a sphere.
 
   - We can think of adding a test for the spherical topology, similar to the
     construction test developed by Baruch: Namely read n curves from a file,

Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/bench_arr_ellipses.cpp

@@ -30,7 +30,7 @@ int main (int argc, char *argv[])
     std::cerr << "Usage: " << argv[0] << " <file name> <method>"
               << std::endl
               << "method is either:" << std::endl
-              << "    -a for aggragated insertion;" << std::endl
+              << "    -a for aggregated insertion;" << std::endl
               << "    -n for incremental insertion with naive point-location;"
               << std::endl
               << "    -w for incremental insertion with walk point-location."

Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/bench_arr_polylines.cpp

@@ -2,7 +2,7 @@
 // of line segments it reads from a file.
 //
 // Usage: seg_arr <-a | -n | -w> <input file>
-// Where: -a  --  Use aggragated insertion (sweep-line);
+// Where: -a  --  Use aggregated insertion (sweep-line);
 //        -n  --  Use incremental insertion with naive point-location;
 //        -w  --  Use incremental insertion with walk point-location.
 //
@@ -70,7 +70,7 @@ int main (int argc, char **argv)
     std::cerr << "Usage: " << argv[0] << " <file name> <method> [format]"
               << std::endl
               << "method is either:" << std::endl
-              << "    -a for aggragated insertion;" << std::endl
+              << "    -a for aggregated insertion;" << std::endl
               << "    -n for incremental insertion with naive point-location;"
               << std::endl
               << "    -w for incremental insertion with walk point-location."

Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/bench_arr_segments.cpp

@@ -2,7 +2,7 @@
 // of line segments it reads from a file.
 //
 // Usage: seg_arr <-a | -n | -w> <input file>
-// Where: -a  --  Use aggragated insertion (sweep-line);
+// Where: -a  --  Use aggregated insertion (sweep-line);
 //        -n  --  Use incremental insertion with naive point-location;
 //        -w  --  Use incremental insertion with walk point-location.
 //
@@ -70,7 +70,7 @@ int main (int argc, char **argv)
     std::cerr << "Usage: " << argv[0] << " <file name> <method> [format]"
               << std::endl
               << "method is either:" << std::endl
-              << "    -a for aggragated insertion;" << std::endl
+              << "    -a for aggregated insertion;" << std::endl
               << "    -n for incremental insertion with naive point-location;"
               << std::endl
               << "    -s for incremental insertion with simple point-location;"

Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.h

@@ -21,7 +21,7 @@
 
 class QGraphicsScene;
 
-// Genereic `Arr_compute_y_at_x_2`
+// Generic `Arr_compute_y_at_x_2`
 template <typename Traits_>
 class Arr_compute_y_at_x_2 : public GraphicsSceneMixin {
 public:

Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Aos.cpp

@@ -30,7 +30,7 @@
 using json = nlohmann::ordered_json;
 
 namespace {
-  // use this traits everytime you construct an arrangment!
+  // use this traits every time you construct an arrangement!
   static Geom_traits s_traits;
 
   // Extended DCEL & Arrangement
@@ -726,7 +726,7 @@ void Aos::save_arr(Kml::Placemarks& placemarks, const std::string& file_name) {
 
   ////////////////////////////////////////////////////////////////////////////
   // CURVES
-  // define a map from each curve to its position in the arrangment
+  // define a map from each curve to its position in the arrangement
   auto& js_curves = js["curves"] = json::array();
   using Ext_curve = Ext_aos::X_monotone_curve_2;
   std::map<Ext_curve*, std::size_t> curve_pos_map;
@@ -909,7 +909,7 @@ void Aos::save_arr(Kml::Placemarks& placemarks, const std::string& file_name) {
   }
   std::cout << "total num half-edges = " << total_num_half_edges << std::endl;
 
-  // save the arrangment
+  // save the arrangement
   std::ofstream ofile(file_name);
   ofile << js.dump(2);
   ofile.close();

Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Aos_triangulator.cpp

@@ -36,7 +36,7 @@ using json = nlohmann::ordered_json;
 
 namespace {
 
-  // use this traits everytime you construct an arrangment!
+  // use this traits every time you construct an arrangement!
   static Geom_traits s_traits;
   using Dir3 = Kernel::Direction_3;
   using Approximate_number_type = Geom_traits::Approximate_number_type;
@@ -71,7 +71,7 @@ std::vector<QVector3D> Aos_triangulator::get_all(Aos::Arr_handle arrh) {
     // COMPUTE THE CENTROID OF ALL FACE-POINTS
     std::vector<QVector3D> face_points;
 
-    // loop on the egdes of the current outer-ccb
+    // loop on the edges of the current outer-ccb
     auto first = fh->outer_ccb();
     auto curr = first;
     do {
@@ -225,7 +225,7 @@ Aos_triangulator::get_by_country(Aos::Arr_handle arrh, float error,
       if (0 == fh->number_of_outer_ccbs()) continue;
 
       std::vector<QVector3D> face_points;
-      // Loop on the egdes of the current outer-ccb
+      // Loop on the edges of the current outer-ccb
       auto first = fh->outer_ccb();
       auto curr = first;
       do {

Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Main_widget.h

@@ -73,7 +73,7 @@ class Main_widget : public QOpenGLWidget, protected OpenGLFunctionsBase {
   // This is called when the required approximation of the arcs is below the
   // currently required one defined by the zoom level and window size. If you
   // zoom-in or increase the window-size this can be called. But once a minimum
-  // approximation error is needed, it will stay there until futher change.
+  // approximation error is needed, it will stay there until further change.
   // SEE the definition of "m_current_approx_error" member variable below!
   float compute_backprojected_error(float pixel_error);
 
@@ -124,7 +124,7 @@ class Main_widget : public QOpenGLWidget, protected OpenGLFunctionsBase {
   // After zooming in or making the viewport larger, the approximation-error
   // needs to be updated and checked against the old value. If a lower approxi-
   // mation error is needed the necessary graphics-side updates need to be made
-  // INSIDE the paintGL (or whereever the OpenGL context is active)!
+  // INSIDE the paintGL (or wherever the OpenGL context is active)!
   bool m_update_approx_error = false;
   float m_current_approx_error;
   std::size_t m_num_uniform_points;

Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Main_widget_old.h

@@ -74,7 +74,7 @@ class Main_widget : public QOpenGLWidget, protected OpenGLFunctionsBase {
   // This is called when the required approximation of the arcs is below the
   // currently required one defined by the zoom level and window size. If you
   // zoom-in or increase the window-size this can be called. But once a minimum
-  // approximation error is needed, it will stay there until futher change.
+  // approximation error is needed, it will stay there until further change.
   // SEE the definition of "m_current_approx_error" member variable below!
   float compute_backprojected_error(float pixel_error);
 
@@ -139,7 +139,7 @@ class Main_widget : public QOpenGLWidget, protected OpenGLFunctionsBase {
   // After zooming in or making the viewport larger, the approximation-error
   // needs to be updated and checked against the old value. If a lower approxi-
   // mation error is needed the necessary graphics-side updates need to be made
-  // INSIDE the paintGL (or whereever the OpenGL context is active)!
+  // INSIDE the paintGL (or wherever the OpenGL context is active)!
   bool m_update_approx_error = false;
   float m_current_approx_error;
 

Arrangement_on_surface_2/demo/Arrangement_on_surface_2_earth/Verification.h

@@ -20,7 +20,7 @@
 class Verification {
 public:
   // Use this to find the approximate of the true minimum projected error.
-  // we are ot using this complicated method, but provide it for completeness.
+  // we are mot using this complicated method, but provide it for completeness.
   static void find_minimum_projected_error_on_sphere(float we, Camera& cam,
                                                      int vp_width,
                                                      int vp_height);

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel.h

@@ -5,15 +5,15 @@ namespace CGAL {
  * The \dcel class used by the `Arrangement_2`,
  * `Arr_bounded_planar_topology_traits_2`, `Arr_unb_planar_topology_traits_2`
  * class templates and other templates.  It is parameterized by a geometry
- * traits type and optionaly by a vertex, halfedge, or face types. By default,
+ * traits type and optionally by a vertex, halfedge, or face types. By default,
  * the `Arr_dcel` class template uses the \link
  * ArrangementBasicTraits_2::Point_2 `Point_2`\endlink and \link
  * ArrangementBasicTraits_2::X_monotone_curve_2 `X_monotone_curve_2`\endlink
  * types nested in the traits type to instantiate the vertex and base halfedge
  * types, respectively. Thus, by default the \dcel only stores the topological
  * incidence relations and the geometric data attached to vertices and
  * edges. Any one of the vertex, halfedge, or face types can be
- * overriden. Notice that if the vertex and halfedge types are overriden, the
+ * overridden. Notice that if the vertex and halfedge types are overridden, the
  * traits type is ignored.
  *
  * \cgalModels{ArrangementDcelWithRebind}

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h

@@ -109,7 +109,7 @@ namespace CGAL {
      * polycurve.
      *
      * This functor constructs general polycurve. Its `operator()` is
-     * oveloaded to support various input types.
+     * overloaded to support various input types.
      *
      * Note that the composing subcurves, depending on the `SubcurveTraits_2`,
      * might not be \f$x\f$-monotone.

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polyline_traits_2.h

@@ -209,7 +209,7 @@ class Arr_polyline_traits_2 : public Arr_polycurve_traits_2<SegmentTraits_2>{
    * polyline.
    *
    * This functor constructs general polylines. Its `operator()` is
-   * oveloaded to support various input types.
+   * overloaded to support various input types.
    *
    * Note that the composing segments, depending on the `SegmentTraits_2`,
    * might not be \f$x\f$-monotone.

Arrangement_on_surface_2/include/CGAL/Aos_observer.h

@@ -519,20 +519,20 @@ class Aos_observer {
    */
   virtual void after_move_isolated_vertex(Vertex_handle /* v */) {}
 
-  /*! Notificaion before the removal of a vertex.
+  /*! Notification before the removal of a vertex.
    * \param v A handle to the vertex to be deleted.
    */
   virtual void before_remove_vertex(Vertex_handle /* v */) {}
 
-  /*! Notificaion after the removal of a vertex. */
+  /*! Notification after the removal of a vertex. */
   virtual void after_remove_vertex() {}
 
   /*! Notification before the removal of an edge.
    * \param e A handle to one of the twin halfedges to be deleted.
    */
   virtual void before_remove_edge(Halfedge_handle /* e */) {}
 
-  /*! Notificaion after the removal of an edge. */
+  /*! Notification after the removal of an edge. */
   virtual void after_remove_edge() {}
 
   /*! Notification before the removal of an outer CCB.
@@ -543,7 +543,7 @@ class Aos_observer {
                                        Ccb_halfedge_circulator /* h */)
   {}
 
-  /*! Notificaion after the removal of an outer CCB.
+  /*! Notification after the removal of an outer CCB.
    * \param f The face that used to own the outer CCB.
    */
   virtual void after_remove_outer_ccb(Face_handle /* f */) {}
@@ -556,7 +556,7 @@ class Aos_observer {
                                        Ccb_halfedge_circulator /* h */)
   {}
 
-  /*! Notificaion after the removal of an inner CCB.
+  /*! Notification after the removal of an inner CCB.
    * \param f The face that used to contain the inner CCB.
    */
   virtual void after_remove_inner_ccb(Face_handle /* f */) {}