Spelling corrections

albert-github · Sep 2, 2024 · 3721830 · 3721830
1 parent 12f278e
commit 3721830
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 4 deletions.
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
@@ -426,7 +426,7 @@ void test_algebraic_structure_intern(
     //commutative
     assert(a+b+c==c+b+a);
     assert(a*b*c==c*b*a);
-    //distributiv
+    //distributive
     assert((a-b)*c==a*c-b*c);
     assert((a+b)*c==a*c+b*c);
     //binom

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/circle_segments/intersect b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/circle_segments/intersect
@@ -1,6 +1,6 @@
 # Input is based on the curves and points indexes from intersect.pt 
 # intersect.xcv. The first two numbers are the numbers of the input curves
-# to be intersected. After that there is the number of intesections and 
+# to be intersected. After that there is the number of intersections and 
 # 2-3 numbers representing each intersection. Meaning, the input is of the form:
 # intersect <id of 1st x-curve> <id of 2nd x-curve> \
 # <expected number of intersections> [<type of intersection> \

diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
@@ -92400,7 +92400,7 @@ @article{kd-pamm-82
 
 @inproceedings{kn-afrmt-97
 , author =      "Yoshiyuki Kusakari and Takao Nishizeki"
-, title =       "An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescibed Terminals"
+, title =       "An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescribed Terminals"
 , booktitle =   "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
 , nickname =    "ISAAC '97"
 , site =        "Singapore"

diff --git a/...rameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h b/...rameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h
@@ -234,7 +234,7 @@ class Square_border_parameterizer_3
       // If the target is a corner vertex, we have the complete length of a side in 'len'
       // and we must "normalize" the previous entries
       if(get(vpmap, vt)) {
-        // If both extremeties of a segment are corners, offsets are already correct
+        // If both extremities of a segment are corners, offsets are already correct
         if(!get(vpmap, vs)) {
           CGAL_assertion(len != 0.0);
           double ld = 1.0 / len;