Typo: labelled is UK English

Documentation/doc/biblio/geom.bib

@@ -101937,7 +101937,7 @@ used in many computational geometry algorithms. Contains C++ code."
 
 @inproceedings{mp-drlvd-84
 , author =      "T. Matsuyama and T. Phillips"
-, title =       "Digital Realization of the Labelled {Voronoi} Diagram and its Application to Closed Boundary Detection"
+, title =       "Digital Realization of the Labeled {Voronoi} Diagram and its Application to Closed Boundary Detection"
 , booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn."
 , year =        1984
 , pages =       "478--480"
@@ -116182,7 +116182,7 @@ dither and stipple patterns."
 
 @techreport{plvt-edecl-96
 , author =      "P. Parodi and R. Lancewicki and A. Vijh and J. K. Tsotsos"
-, title =       "Empirically-derived Estimates of the Complexity of Labelling Line Drawings of Polyhedral Scenes"
+, title =       "Empirically-derived Estimates of the Complexity of Labeling Line Drawings of Polyhedral Scenes"
 , number =      "RBCV-TR-96-52"
 , institution = "Dept. Comput. Sci., Univ. Toronto"
 , address =     "Toronto, ON"
@@ -116759,7 +116759,7 @@ dither and stipple patterns."
 
 @article{p-rflg-72
 , author =      "T. Pavlidis"
-, title =       "Representation of figures by labelled graphs"
+, title =       "Representation of figures by labeled graphs"
 , journal =     "Pattern Recogn."
 , volume =      4
 , year =        1972
@@ -133630,7 +133630,7 @@ Contains C code."
 
 @inproceedings{sc-aipta-86
 , author =      "J. K. Sircar and J. A. Cerbrian"
-, title =       "Application of image processing techniques to the automated labelling of raster digitized contours"
+, title =       "Application of image processing techniques to the automated labeling of raster digitized contours"
 , booktitle =   "Proc. 2nd Internat. Sympos. Spatial Data Handling"
 , year =        1986
 , pages =       "171--184"
@@ -151991,7 +151991,7 @@ month = {jun},
 articleno = {156},
 numpages = {14},
 keywords = {polygonal surface mesh, Surface reconstruction, kinetic framework, surface approximation}
-}  
+}
 
 @article{levismooth,
   title={Smooth Rotation Enhanced As-Rigid-As-Possible Mesh Animation},

Kinetic_surface_reconstruction/include/CGAL/Kinetic_surface_reconstruction_3.h

@@ -2041,14 +2041,14 @@ private:
     // 4 xmin
     // 5 zmax
     const double force = static_cast<double>(m_total_inliers * 3);
-    // 0 - cost for labelled as outside
+    // 0 - cost for labeled as outside
     cost_matrix[0][0] = 0;
     cost_matrix[0][1] = 0;
     cost_matrix[0][2] = 0;
     cost_matrix[0][3] = 0;
     cost_matrix[0][4] = 0;
     cost_matrix[0][5] = 0;
-    // 1 - cost for labelled as inside
+    // 1 - cost for labeled as inside
     cost_matrix[1][0] = 0;
     cost_matrix[1][1] = 0;
     cost_matrix[1][2] = 0;

Mesh_3/include/CGAL/Labeled_mesh_domain_3.h

@@ -1097,7 +1097,7 @@ public:
     Surface_patch operator()(const Point_3& a, const Point_3& b) const
     {
       // If f(a) != f(b), then [a,b] intersects some surface. Here we consider
-      // [a,b] intersects surface_patch labelled <f(a),f(b)> (or <f(b),f(a)>).
+      // [a,b] intersects surface_patch labeled <f(a),f(b)> (or <f(b),f(a)>).
       // It may be false, further rafinement will improve precision
       const Subdomain_index value_a = r_domain_.function_(a);
       const Subdomain_index value_b = r_domain_.function_(b);

Orthtree/doc/Orthtree/Orthtree.txt

@@ -197,7 +197,7 @@ Figure \cgalFigureRef{Orthtree_traversal_fig} shows in which order
 nodes are visited depending on the traversal method used.
 
 \cgalFigureBegin{Orthtree_traversal_fig, quadtree_traversal.png}
-%Quadtree visualized as a graph. Each node is labelled according to the
+%Quadtree visualized as a graph. Each node is labeled according to the
 order in which it is visited by the traversal. When using leaves and
 level traversals, the quadtree is only partially traversed.
 \cgalFigureEnd

Surface_mesher/doc/Surface_mesher/Surface_mesher.txt

@@ -313,7 +313,7 @@ class is not yet documented because its interface and code have not yet
 been stabilized.
 
 The Surface Mesh Generator demo allows to mesh not only gray level images,
-but also segmented images, when voxels are labelled with a domain
+but also segmented images, when voxels are labeled with a domain
 index. Such images are for example the result of a segmentation of 3D
 medical images.