Spelling corrections (CGAL#9289)

sloriot · web-flow · commit 33a2a257bde0 · 2026-01-20T15:45:55.000+01:00
Spelling corrections
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/QtMetaTypes.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/QtMetaTypes.h
@@ -9,8 +9,8 @@
 //
 // Author(s): Ahmed Essam <theartful.ae@gmail.com>
 
-#ifndef ARRANGEMENET_DEMO_QT_METATYPES_H
-#define ARRANGEMENET_DEMO_QT_METATYPES_H
+#ifndef ARRANGEMENT_DEMO_QT_METATYPES_H
+#define ARRANGEMENT_DEMO_QT_METATYPES_H
 
 #include <QMetaType>
 #include <CGAL/Object.h>
diff --git a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation.h b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation.h
@@ -392,7 +392,7 @@ namespace CGAL {
   private:
     void run(const double desired_eps)
       // Runs Khachiyans algorithm, provided the points added so far
-      // are non-degnerate.  On return, the variable x will be a
+      // are non-degenerate.  On return, the variable x will be a
       // solution to program (D) for the points P such that the
       // relaxed optimality conditions (*) hold.
       //
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
@@ -4805,7 +4805,7 @@ fixes for this release.
     removed.
 - The deprecated linear kernel functors `Construct_supporting_line_2`
     and `Construct_supporting_line_3` have been removed.
-- `Ambiant_dimension` and `Feature_dimenison` have been added to
+- `Ambiant_dimension` and `Feature_dimension` have been added to
     retrieve the potentially compile-time dimension of a space or of an
     object.
 - `barycenter()` functions have been added.
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
@@ -491,7 +491,7 @@ class Surface_mesh
             return !operator==(rhs);
         }
 
-        /// pre-increment (rotate couter-clockwise)
+        /// pre-increment (rotate counter-clockwise)
         Vertex_around_vertex_circulator& operator++()
         {
             assert(mesh_);
@@ -549,7 +549,7 @@ class Surface_mesh
             return !operator==(rhs);
         }
 
-        /// pre-increment (rotate couter-clockwise)
+        /// pre-increment (rotate counter-clockwise)
         Halfedge_around_vertex_circulator& operator++()
         {
             assert(mesh_);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h b/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
@@ -304,7 +304,7 @@ class Mesh_global_optimizer
   /**
    * Launch optimization process
    *
-   * @param nb_interations maximum number of iterations
+   * @param nb_iterations maximum number of iterations
    */
   Mesh_optimization_return_code operator()(int nb_iterations,
                                            Visitor v = Visitor());
diff --git a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
@@ -390,7 +390,7 @@ class Slivers_exuder
 
   /** Pre_star will represent the pre-star of a point. It is a (double)-map
    *  of Facet (viewed from cells inside the star), ordered by the
-   *  critial_radius of the point with the cell that lies on the facet, at
+   *  critical_radius of the point with the cell that lies on the facet, at
    *  the exterior of the pre-star. */
   typedef CGAL::Double_map<Facet, FT>                       Pre_star;
 
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -624,7 +624,7 @@ class Mesh_domain_with_polyline_features_3
   add_features_and_incidences
   (InputIterator first, InputIterator end,
    PolylinePMap polyline_pmap,
-   IncidentPatchesIndicesPMap incident_paches_indices_pmap,
+   IncidentPatchesIndicesPMap incident_patches_indices_pmap,
    IndicesOutputIterator out /* = CGAL::Emptyset_iterator() */);
 
   template <typename InputIterator, typename IndicesOutputIterator>
diff --git a/Nef_S2/include/CGAL/Nef_S2/Sphere_geometry_OGL.h b/Nef_S2/include/CGAL/Nef_S2/Sphere_geometry_OGL.h
@@ -96,7 +96,7 @@ class Approximator {
 
     /* we construct the rotation matrix that transfers the x-axis
        into |ps_|, the z-axis into h_.orthogonal_vector() and the
-       y-axix into the corresponding crossproduct of the two.*/
+       y-axis into the corresponding crossproduct of the two.*/
     if ( s.is_degenerate() ) {
       VSegment S(1);
       S[0] = approximate(s.source());
@@ -153,7 +153,7 @@ class Approximator {
 
     /* we construct the rotation matrix that transfers the x-axis
        into |ps_|, the z-axis into h_.orthogonal_vector() and the
-       y-axix into the corresponding crossproduct of the two.*/
+       y-axis into the corresponding crossproduct of the two.*/
 
     VVector v0 = convert(s.base1());
     VVector v1 = convert(s.base2());
diff --git a/Number_types/include/CGAL/NT_wrapper.h b/Number_types/include/CGAL/NT_wrapper.h
@@ -29,7 +29,7 @@
 namespace CGAL {
 
 /*
- * This class template `NT_wapper<NT>` is currently undocumented, on purpose.
+ * This class template `NT_wrapper<NT>` is currently undocumented, on purpose.
  *
  * This class template provides a wrapper for number types. It calls a function
  * `f` when a constructor, destructor, or assignment operator is called. This
@@ -191,4 +191,4 @@ struct Wrapped_epeck
 
 #endif // __cpp_lib_source_location
 
-#endif // CGAL_NT_WRAPPER_H
+#endif // CGAL_NT_WRAPPER_H
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
@@ -2273,7 +2273,7 @@ make_canonical(Vertex_triple& t) const
   *
   * returns the cell p lies in
   * starts at cell "start"
-  * returns a cell Cell_handel if lt == CELL
+  * returns a cell Cell_handle if lt == CELL
   * returns a facet (Cell_handle,li) if lt == FACET
   * returns an edge (Cell_handle,li,lj) if lt == EDGE
   * returns a vertex (Cell_handle,li) if lt == VERTEX
diff --git a/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/CMakeLists.txt
@@ -15,9 +15,9 @@ if(NOT TARGET CGAL::Eigen3_support)
   return()
 endif()
 
-set(FAST_ENVELOPE_BUILD_DIR "" CACHE PATH "Path to fast-evelope build directory")
+set(FAST_ENVELOPE_BUILD_DIR "" CACHE PATH "Path to fast-envelope build directory")
 if (FAST_ENVELOPE_BUILD_DIR)
-  message(STATUS "Using ${FAST_ENVELOPE_BUILD_DIR} as build directory of fast-evelope")
+  message(STATUS "Using ${FAST_ENVELOPE_BUILD_DIR} as build directory of fast-envelope")
 
   include_directories("${FAST_ENVELOPE_BUILD_DIR}/include")
   link_directories ( "${FAST_ENVELOPE_BUILD_DIR}/lib" "${FAST_ENVELOPE_BUILD_DIR}" "${FAST_ENVELOPE_BUILD_DIR}/tbb")
diff --git a/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/Quality/quality_snap_polygon_soup.cpp b/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/Quality/quality_snap_polygon_soup.cpp
@@ -53,8 +53,8 @@ int main(int argc, char** argv)
   std::cout << std::setprecision(17) <<
    "\"Hausdorff_distance_output_to_input_(divide_by_bbox_diag)\": \"" << PMP::max_distance_to_triangle_mesh<CGAL::Parallel_if_available_tag>(input_points, sm) / diag_length << "\",\n" <<
    "\"Closed_output\": \"" << (CGAL::is_closed(sm)?"True":"False") << "\",\n" <<
-   "\"Ouput_bound_a_volume\": \"" << (PMP::does_bound_a_volume(sm)?"True":"False") << "\"\n}"
+   "\"Output_bound_a_volume\": \"" << (PMP::does_bound_a_volume(sm)?"True":"False") << "\"\n}"
   << std::endl;
 
   return 0;
-}
+}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -79,7 +79,7 @@
 \cgalPkgPicture{hole_filling_ico.png}
 
 \cgalPkgSummaryBegin
-\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, Sébastien Valette, and Ilker %O. Yaz}
+\cgalPkgAuthors{David Coeurjolly, Jacques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, Sébastien Valette, and Ilker %O. Yaz}
 \cgalPkgDesc{This package provides a collection of methods and classes for polygon mesh processing,
 ranging from basic operations on simplices, to complex geometry processing algorithms such as
 Boolean operations, remeshing, repairing, collision and intersection detection, and more.}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -4,7 +4,7 @@ namespace CGAL {
 \anchor Chapter_PolygonMeshProcessing
 
 \cgalAutoToc
-\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, Sébastien Valette, Léo Valque, and Ilker %O. Yaz
+\authors David Coeurjolly, Jacques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, Sébastien Valette, Léo Valque, and Ilker %O. Yaz
 
 \image html neptun_head.jpg
 \image latex neptun_head.jpg
@@ -1468,7 +1468,7 @@ is covered by a set of prisms, where each prism is an offset for an input triang
 That is, the implementation in \cgal does not use indirect predicates.
 
 The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under the
-supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{cgal:lrtc-iccmps-20}.
+supervision of David Coeurjolly, Jacques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{cgal:lrtc-iccmps-20}.
 <a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
 used as a reference during the project.
 
diff --git a/Polytope_distance_d/test/Polytope_distance_d/all_furthest_neighbors_2_test.cpp b/Polytope_distance_d/test/Polytope_distance_d/all_furthest_neighbors_2_test.cpp
@@ -78,7 +78,7 @@ int main()
                            neighbors2.begin()));
   } // for (i = 0..4)
 
-  // try also once with a random-acccess iterator:
+  // try also once with a random-access iterator:
   int n = 222;
   // generate random convex polygon:
   Polygon_2 p;
diff --git a/Property_map/include/CGAL/Property_container.h b/Property_map/include/CGAL/Property_container.h
@@ -9,8 +9,8 @@
 //
 // Author(s)     : Jackson Campolattaro
 
-#ifndef CGAL_PROPERTY_CONTAINTER_H
-#define CGAL_PROPERTY_CONTAINTER_H
+#ifndef CGAL_PROPERTY_CONTAINER_H
+#define CGAL_PROPERTY_CONTAINER_H
 
 #include <CGAL/assertions.h>
 
@@ -643,4 +643,4 @@ class Property_container {
 
 #endif // DOXYGEN_RUNNING
 
-#endif //CGAL_PROPERTY_CONTAINTER_H
+#endif //CGAL_PROPERTY_CONTAINER_H
diff --git a/Ridges_3/doc/Ridges_3/Ridges_3.txt b/Ridges_3/doc/Ridges_3/Ridges_3.txt
@@ -370,7 +370,7 @@ The ridge lines are stored in
 `Ridge_line` objects and output through an iterator.
 Each ridge line is represented as a list of halfedges of the mesh it
 crosses with a scalar defining the barycentric coordinate of the
-crossing point with respect to the half-egde endpoints. Each ridge
+crossing point with respect to the half-edge endpoints. Each ridge
 line comes with its type `Ridge_type`, its strength and sharpness.
 
 If one chooses to use only third order quantities, the quantities
diff --git a/Shape_regularization/doc/Shape_regularization/Shape_regularization.txt b/Shape_regularization/doc/Shape_regularization/Shape_regularization.txt
@@ -578,7 +578,7 @@ developed and implemented by Dmitry Anisimov and Simon Giraudot. Plane regulariz
 was added by Simon Giraudot based on the prototype version developed by Florent Lafarge.
 
 
-\section Shape_Regularization_Acknowledgements Acknowledgments
+\section Shape_Regularization_Acknowledgments Acknowledgments
 
 We wish to thank Andreas Fabri and Marc Pouget for useful discussions and reviews.
 */
diff --git a/Spatial_searching/include/CGAL/Orthogonal_incremental_neighbor_search.h b/Spatial_searching/include/CGAL/Orthogonal_incremental_neighbor_search.h
@@ -473,7 +473,7 @@ namespace CGAL {
 
       CGAL_DEPRECATED void Compute_the_next_furthest_neighbour()
       { Compute_the_next_furthest_neighbor(); }
-    }; // class Iterator_implementaion
+    }; // class Iterator_implementation
 
 
 
diff --git a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
@@ -338,7 +338,7 @@ _test_cls_constrained_triangulation(const Triang &)
   T2_2.remove(vha);
   assert(T2_2.is_valid());
 
-  // test Constained_edges_iterator
+  // test Constrained_edges_iterator
   Triang T2_6;
 
   T2_6.insert(Point(0,0));
diff --git a/Weights/doc/Weights/Weights.txt b/Weights/doc/Weights/Weights.txt
@@ -208,7 +208,7 @@ This package is a part of the weights unification effort inside \cgal that has b
 carried out by Dmitry Anisimov in 2020.
 
 
-\section Weights_Acknowledgements Acknowledgments
+\section Weights_Acknowledgments Acknowledgments
 
 We wish to thank Guillaume Damiand, Andreas Fabri, and Mael Rouxel-Labbé for useful
 discussions and reviews.

Original file line number	Diff line number	Diff line change
`@@ -491,7 +491,7 @@ class Surface_mesh`
`491`	`491`	`return !operator==(rhs);`
`492`	`492`	`}`
`493`	`493`
`494`		`- /// pre-increment (rotate couter-clockwise)`
	`494`	`+ /// pre-increment (rotate counter-clockwise)`
`495`	`495`	`Vertex_around_vertex_circulator& operator++()`
`496`	`496`	`{`
`497`	`497`	`assert(mesh_);`
`@@ -549,7 +549,7 @@ class Surface_mesh`
`549`	`549`	`return !operator==(rhs);`
`550`	`550`	`}`
`551`	`551`
`552`		`- /// pre-increment (rotate couter-clockwise)`
	`552`	`+ /// pre-increment (rotate counter-clockwise)`
`553`	`553`	`Halfedge_around_vertex_circulator& operator++()`
`554`	`554`	`{`
`555`	`555`	`assert(mesh_);`
Original file line number	Diff line number	Diff line change
`@@ -304,7 +304,7 @@ class Mesh_global_optimizer`
`304`	`304`	`/**`
`305`	`305`	`* Launch optimization process`
`306`	`306`	`*`
`307`		`- * @param nb_interations maximum number of iterations`
	`307`	`+ * @param nb_iterations maximum number of iterations`
`308`	`308`	`*/`
`309`	`309`	`Mesh_optimization_return_code operator()(int nb_iterations,`
`310`	`310`	`Visitor v = Visitor());`
Original file line number	Diff line number	Diff line change
`@@ -2273,7 +2273,7 @@ make_canonical(Vertex_triple& t) const`
`2273`	`2273`	`*`
`2274`	`2274`	`* returns the cell p lies in`
`2275`	`2275`	`* starts at cell "start"`
`2276`		`- * returns a cell Cell_handel if lt == CELL`
	`2276`	`+ * returns a cell Cell_handle if lt == CELL`
`2277`	`2277`	`* returns a facet (Cell_handle,li) if lt == FACET`
`2278`	`2278`	`* returns an edge (Cell_handle,li,lj) if lt == EDGE`
`2279`	`2279`	`* returns a vertex (Cell_handle,li) if lt == VERTEX`