spelling corrections

Some spelling corrections (Directories starting with `S` rest - `W`),

Author: albert-github

Scale_space_reconstruction_3/examples/Scale_space_reconstruction_3/scale_space_incremental.cpp

@@ -81,6 +81,6 @@ int main(int argc, char* argv[])
       }
     }
 
-    std::cout << "Reconstructions are ready to be examinated in your favorite viewer" << std::endl;
+    std::cout << "Reconstructions are ready to be examined in your favorite viewer" << std::endl;
     return EXIT_SUCCESS;
 }

Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Shape_construction_3.h

@@ -117,7 +117,7 @@ class Shape_construction_3
     /** Important note: Shape_construction_3 does not take responsibility for destroying
      *  the object after use.
      *
-     *  \tparam InputIterator an interator over the points.
+     *  \tparam InputIterator an iterator over the points.
      *  The iterator should point to a model of Point.
      *  \param begin is an iterator to the first point of the shape.
      *  \param end is a past-the-end iterator for the points.

SearchStructures/include/CGAL/Range_tree_d.h

@@ -27,7 +27,7 @@
 // A d-dimensional Range Tree or a multilayer tree consisting of Range
 // and other trees that are derived public
 // Tree_base<C_Data, C_Window, C_Interface>
-// can be construced within this class.
+// can be constructed within this class.
 // C_Data: container class which contains the d-dimensional data the tree holds.
 // C_Window: Query window -- a d-dimensional interval
 // C_Interface: Interface for the class with functions that allow to
@@ -202,7 +202,7 @@ class Range_tree_d: public Tree_base< C_Data,  C_Window>
   // recursive function
   // (current,last) describe an interval of length n of sorted elements,
   // for this interval a tree is build containing these elements.
-  // the most left child is returend in prevchild.
+  // the most left child is returned in prevchild.
 
   template <class T>
   void build_range_tree(int n, link_type& leftchild,
@@ -268,7 +268,7 @@ class Range_tree_d: public Tree_base< C_Data,  C_Window>
       }
       else
       {
-        // recursiv call for the construction. the interval is devided.
+        // recursiv call for the construction. the interval is divided.
         T sublevel_left, sublevel_right;
         build_range_tree(n - (int)n/2, leftchild, rightchild,
                          prevchild, leftmostlink, current, last,

SearchStructures/include/CGAL/Segment_tree_d.h

@@ -263,7 +263,7 @@ class Segment_tree_d: public Tree_base< C_Data,  C_Window>
        }
        else
        {
-         // recursiv call for the construction. the interval is devided.
+         // recursiv call for the construction. the interval is divided.
          build_segment_tree(n - (int)n/2, leftchild, rightchild,
                          prevchild, leftmostlink, index, last, keys);
          link_type vparent = new_Segment_tree_node_t

SearchStructures/include/CGAL/Tree_base.h

@@ -131,7 +131,7 @@ class Tree_base
 // -------------------------------------------------------------------
 // Tree Anchor: this class is used as a recursion anchor.
 // The derived tree classes can be nested. Use this class as the
-// most inner class. This class is doing nothin exept stopping the recursion
+// most inner class. This class is doing nothing except stopping the recursion
 
 template <class C_Data, class C_Window>
 class Tree_anchor: public Tree_base< C_Data,  C_Window>

Segment_Delaunay_graph_2/TODO

@@ -1,5 +1,5 @@
 - For release:
-  * add example that demostrates how to get edge info
+  * add example that demonstrates how to get edge info
   * remove enumeration type Arrangement_type as an enum type and add small
     is_*() methods that query the type
   * add test suites for {insert,remove}_degree_2 in TDS_2

Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h

@@ -6,10 +6,10 @@
 The vertex of a segment Delaunay graph
 included in a segment Delaunay graph hierarchy has to provide
 some pointers to the corresponding vertices in the
-graphs of the next and preceeding levels.
+graphs of the next and preceding levels.
 Therefore, the concept `SegmentDelaunayGraphHierarchyVertexBase_2`
 refines the concept `SegmentDelaunayGraphVertexBase_2`, by
-adding two vertex handles to the correponding vertices for the
+adding two vertex handles to the corresponding vertices for the
 next and previous level graphs.
 
 \cgalRefines `SegmentDelaunayGraphVertexBase_2`

Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h

@@ -2118,9 +2118,9 @@ remove_degree_d_vertex(const Vertex_handle& v)
   // here we find a site in the small diagram that serves as a
   // starting point for finding all conflicts.
   // To do that we find the nearest neighbor of t if t is a point;
-  // t is guarranteed to have a conflict with its nearest neighbor
+  // t is guaranteed to have a conflict with its nearest neighbor
   // If t is a segment, then one endpoint of t is enough; t is
-  // guarranteed to have a conflict with the Voronoi edges around
+  // guaranteed to have a conflict with the Voronoi edges around
   // this endpoint
   if ( t.is_point() ) {
     vn = sdg_small.nearest_neighbor( t.point() );
@@ -2876,7 +2876,7 @@ copy(Segment_Delaunay_graph_2& other, Handle_map& hm)
   // then copy the diagram
   DG::operator=(other);
 
-  // now we have to update the sotrage sites in each vertex of the
+  // now we have to update the storage sites in each vertex of the
   // diagram and also update the
 
   // then update the storage sites for each vertex
@@ -3127,7 +3127,7 @@ Segment_Delaunay_graph_2<Gt,ST,D_S,LTag>::
 file_output(std::ostream& os, Point_handle_mapper& P,
             bool print_point_container) const
 {
-  // ouput to a file
+  // output to a file
   size_type n = this->_tds.number_of_vertices();
   size_type m = this->_tds.number_of_full_dim_faces();
 

Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_ring_C2.h

@@ -1502,7 +1502,7 @@ class Voronoi_vertex_ring_C2
 
   vertex_t v_type;
 
-  // index that indicates the refence point for the case PPS
+  // index that indicates the reference point for the case PPS
   short pps_idx;
 
   // the case ppp

Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_sqrt_field_C2.h

@@ -1260,7 +1260,7 @@ class Voronoi_vertex_sqrt_field_C2
 
   vertex_t v_type;
 
-  // index that indicates the refence point for the case PPS
+  // index that indicates the reference point for the case PPS
   short pps_idx;
 
   FT ux, uy, uz;

Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Basic_predicates_C2.h

@@ -1010,7 +1010,7 @@ struct Basic_predicates_C2
       // with the ray starting from corner and going to the
       // direction of the center of the infinite box
 
-      // corner has homogenuous coordinates cx, cy, cw
+      // corner has homogeneous coordinates cx, cy, cw
       RT cx, cy, cw;
       compute_intersection_of_lines(lhor, lver, cx, cy, cw);
 

Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Bisector_Linf.h

@@ -200,7 +200,7 @@ class Bisector_Linf
     else {
       Oriented_side side = lseg.oriented_side(pnt);
 
-      // point pp sould not lie on the supporting line of q
+      // point pp should not lie on the supporting line of q
       CGAL_assertion(! (side == ON_ORIENTED_BOUNDARY));
 
       Point_2 points[3];
@@ -298,7 +298,7 @@ class Bisector_Linf
                   && lseg.has_on_negative_side(pnt)) ) {
                 // pcfirst is center of square,
                 // pfirst = phor, upward direction
-                // pclast is center of sqaure, plast = pver, left direction
+                // pclast is center of square, plast = pver, left direction
                 pcfirst = Point_2(pmid_pfirst_pnt.x(),
                                   pmid_pfirst_pnt.y()+seglenhalffirst);
                 pclast = Point_2(pmid_plast_pnt.x()-seglenhalflast,
@@ -321,7 +321,7 @@ class Bisector_Linf
                   && lseg.has_on_negative_side(pnt)) ) {
                 // pcfirst is center of square,
                 // pfirst = pver, right direction
-                // pclast is center of sqaure, plast = phor, upward dir
+                // pclast is center of square, plast = phor, upward dir
                 pcfirst = Point_2(pmid_pfirst_pnt.x()+seglenhalffirst,
                                   pmid_pfirst_pnt.y());
                 pclast = Point_2(pmid_plast_pnt.x(),

Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Constructions_C2.h

@@ -341,7 +341,7 @@ class Construct_sdg_bisector_2
                   && lseg.has_on_negative_side(pnt)) ) {
                 //pcfirst is center of square,
                 //pfirst = phor, upward direction
-                //pclast is center of sqaure, plast = pver, left direction
+                //pclast is center of square, plast = pver, left direction
                 pcfirst = Point_2(pmid_pfirst_pnt.x(),
                                   pmid_pfirst_pnt.y()+seglenhalffirst);
                 pclast = Point_2(pmid_plast_pnt.x()-seglenhalflast,
@@ -363,7 +363,7 @@ class Construct_sdg_bisector_2
                   && lseg.has_on_negative_side(pnt)) ) {
                 //pcfirst is center of square,
                 //pfirst = pver, right direction
-                //pclast is center of sqaure, plast = phor, upward direction
+                //pclast is center of square, plast = phor, upward direction
                 pcfirst = Point_2(pmid_pfirst_pnt.x()+seglenhalffirst,
                                   pmid_pfirst_pnt.y());
                 pclast = Point_2(pmid_plast_pnt.x(),
@@ -637,7 +637,7 @@ class Construct_sdg_bisector_ray_2
               || (compare_x_2(seg.source(),seg.target()) == LARGER
                   && lseg.has_on_negative_side(pnt)) ) {
             //pcfirst is center of square , pfirst = phor, upward direction
-            //pclast is center of sqaure, plast = pver, left direction
+            //pclast is center of square, plast = pver, left direction
             pcfirst = Point_2(pmid_pfirst_pnt.x(),
                               pmid_pfirst_pnt.y()+seglenhalffirst);
             pclast = Point_2(pmid_plast_pnt.x()-seglenhalflast,
@@ -658,7 +658,7 @@ class Construct_sdg_bisector_ray_2
               || (compare_x_2(seg.source(),seg.target()) == LARGER
                   && lseg.has_on_negative_side(pnt)) ) {
             //pcfirst is center of square , pfirst = pver, right direction
-            //pclast is center of sqaure, plast = phor, upward direction
+            //pclast is center of square, plast = phor, upward direction
             pcfirst = Point_2(pmid_pfirst_pnt.x()+seglenhalffirst,
                               pmid_pfirst_pnt.y());
             pclast = Point_2(pmid_plast_pnt.x(),
@@ -947,7 +947,7 @@ class Construct_sdg_bisector_segment_2
         Point_2 pnt = (p.is_point()) ? p.point() : q.point();
         Segment_2 seg = (p.is_segment()) ? p.segment() : q.segment();
         Site_2 siteseg = (p.is_point()) ? q : p;
-        // lseg is the suporting line of the segment site
+        // lseg is the supporting line of the segment site
         Line_2 lseg = siteseg.supporting_site().segment().supporting_line();
         // segment site is horizontal
         if (lseg.is_horizontal()) {
@@ -1104,7 +1104,7 @@ class Construct_sdg_bisector_segment_2
                 || (compare_x_2(seg.source(),seg.target()) == LARGER
                   && lseg.has_on_negative_side(pnt)) ) {
               //pcfirst is center of square, pfirst = phor, upward direction
-              //pclast is center of sqaure, plast = pver, left direction
+              //pclast is center of square, plast = pver, left direction
               pcfirst = Point_2(pmid_pfirst_pnt.x(),
                                 pmid_pfirst_pnt.y()+seglenhalffirst);
               pclast = Point_2(pmid_plast_pnt.x()-seglenhalflast,
@@ -1125,7 +1125,7 @@ class Construct_sdg_bisector_segment_2
                 || (compare_x_2(seg.source(),seg.target()) == LARGER
                   && lseg.has_on_negative_side(pnt)) ) {
               //pcfirst is center of square , pfirst = pver, right direction
-              //pclast is center of sqaure, plast = phor, upward direction
+              //pclast is center of square, plast = phor, upward direction
               pcfirst = Point_2(pmid_pfirst_pnt.x()+seglenhalffirst,
                                 pmid_pfirst_pnt.y());
               pclast = Point_2(pmid_plast_pnt.x(),

Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Voronoi_vertex_ring_C2.h

@@ -3937,7 +3937,7 @@ class Voronoi_vertex_ring_C2
 
   vertex_t v_type;
 
-  // index that indicates the refence point for the case PPS
+  // index that indicates the reference point for the case PPS
   short pps_idx;
 
   // philaris: different types are not needed any more

Set_movable_separability_2/examples/Set_movable_separability_2/is_pullout_direction_single_mold_trans_cast.cpp

@@ -40,7 +40,7 @@ int main(int  argc, char* argv[])
     auto res = casting::is_pullout_direction(polygon, e_it, d);
     std::cout << "The polygon is " << (res ? "" : "not ")
               << "castable using edge "
-              << index << " in vartical translation (" << d << ")" << std::endl;
+              << index << " in vertical translation (" << d << ")" << std::endl;
 
   }
 

Set_movable_separability_2/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/is_pullout_direction.h

@@ -151,7 +151,7 @@ is_pullout_direction(const CGAL::Polygon_2<CastingTraits_2>& pgn,
                                     segment_outer_circle.second,
                                     segment_outer_circle.first);
     if (!isordered) {
-      // unlikely, this if must be true atleast once for any polygon - add ref
+      // unlikely, this if must be true at least once for any polygon - add ref
       // to paper
       if (top_edge== pgn.edges_end()) top_edge=e_it;
       else return pgn.edges_end();

Set_movable_separability_2/include/CGAL/Set_movable_separability_2/Single_mold_translational_casting/pullout_directions.h

@@ -32,7 +32,7 @@ namespace Single_mold_translational_casting {
  *           intersection in  [firstClockwise,secondClockwise].
  *           When a new semicircle appear the possible cases are as such:
  *           (let f:=firstClockwise, s:=secondClockwise, a:=newSemicircleFirstClockwise , b:=newSemicircleSecondClockwise)
- *        REMEBER THAT THIS ARE SEGMENTS ON A CIRCLE! NOT ON A LINE!
+ *        REMEMBER THAT THIS ARE SEGMENTS ON A CIRCLE! NOT ON A LINE!
  * 1. [f,s] contained in [a,b]
  *                f           s                    *      f                s   *          f        s  *     f        s
  *           a                b          *      a                b   *     a                b  *     a                b
@@ -61,7 +61,7 @@ namespace Single_mold_translational_casting {
  *          f                s *          f                s
  *                a           b          *                 b          a
  *           __________________*        __________________
- *           THIS CASE CANT HAPPEN!! [a,b] is an semicircle, and (f,s) is a semicircle or less
+ *           THIS CASE CAN'T HAPPEN!! [a,b] is a semicircle, and (f,s) is a semicircle or less
  */
 template <typename CastingTraits_2>
 std::pair<bool, std::pair<typename CastingTraits_2::Direction_2,

Set_movable_separability_2/include/CGAL/Set_movable_separability_2/internal/Circle_arrangment.h

@@ -242,7 +242,7 @@ class Circle_arrangment {
    * \param[in] segment_outer_circle - the outer circle of the current segment of
    *        the polygon.
    * \param[in] edge_ite this segment iterator
-   * This is the main funtion of this code. It separates the cells in which the
+   * This is the main function of this code. It separates the cells in which the
    * endpoints of the new arc is contained to two parts and increase m_count
    * for all the cells that the new arc covers. In the end the function
    * merge_adjacent_2_edges_and_remove_empty is called to remove redundant cells
@@ -409,7 +409,7 @@ class Circle_arrangment {
    * add_segment_outer_circle() which calls
    * merge_adjacent_2_edges_and_remove_empty().
    *
-   * The funtions checks that the whole circle is a single cell, which can
+   * The functions checks that the whole circle is a single cell, which can
    * happen only if this cell is of depth 2, so there is no need to check the
    * depth as well.
    * \return if all of the arrangement is in depth 2+

Set_movable_separability_2/package_info/Set_movable_separability_2/long_description.txt

@@ -1,4 +1,4 @@
-Movable Separability of Sets is a class of problems that deal with moving sets of objects, such as polygons in the plane; the challange is to avoid collisions between the objects while considering different kinds of motions and various definitions of separation. At this point this package provides solutions to one subclass of problems related to 2D castings. In particular, each of these solutions handles a single moving polygon and a single stationary polygon, and considers a single translation of the moving polygon.
+Movable Separability of Sets is a class of problems that deal with moving sets of objects, such as polygons in the plane; the challenge is to avoid collisions between the objects while considering different kinds of motions and various definitions of separation. At this point this package provides solutions to one subclass of problems related to 2D castings. In particular, each of these solutions handles a single moving polygon and a single stationary polygon, and considers a single translation of the moving polygon.
 
 The casting process is a form of manufacturing, where liquid material is poured into a mold, it solidifies, and then the object is pulled from the mold. The mold has to be designed in such a way that the object can be removed without breaking the mold. This is not always possible (e.g., a circle).
 

Shape_detection/doc/Shape_detection/Shape_detection.txt

@@ -438,7 +438,7 @@ The points with assigned to them normal vectors are stored in `std::vector` and
 
 \paragraph Shape_detection_RegionGrowingPoints_example_2D_circles Detecting 2D Circles
 
-The following example shows a similar example, this time detecting circles instead of lines. In that case, we also preprocess points so that they are sorted according to their likelyhood of belonging to a circle:
+The following example shows a similar example, this time detecting circles instead of lines. In that case, we also preprocess points so that they are sorted according to their likelihood of belonging to a circle:
 
 \cgalExample{Shape_detection/region_growing_circles_on_point_set_2.cpp}
 

Shape_detection/include/CGAL/Shape_detection/Region_growing/Region_growing_on_polygon_mesh/Least_squares_plane_fit_region.h

@@ -289,7 +289,7 @@ namespace Polygon_mesh {
         // The best fit plane will be a plane fitted to all vertices of all
         // region faces with its normal being perpendicular to the plane.
         // Given that the points, and no normals, are used in estimating
-        // the plane, the estimated normal will point into an arbitray
+        // the plane, the estimated normal will point into an arbitrary
         // one of the two possible directions.
         // We flip it into the correct direction (the one that the majority
         // of faces agree with) below.

Shape_regularization/examples/Shape_regularization/regularize_100_segments_angles.cpp

@@ -34,7 +34,7 @@ int main(int argc, char *argv[]) {
   // Angle regularization.
   const FT max_angle_2 = FT(40);
 
-  // Create neigbor query and angle-based regularization model.
+  // Create neighbor query and angle-based regularization model.
   Neighbor_query neighbor_query(segments);
   Angle_regularization angle_regularization(
     segments, CGAL::parameters::maximum_angle(max_angle_2));

Shape_regularization/examples/Shape_regularization/regularize_100_segments_offsets.cpp

@@ -43,7 +43,7 @@ int main(int argc, char *argv[]) {
   // Offset regularization.
   const FT max_offset_2 = FT(1) / FT(4);
 
-  // Create neigbor query and offset-based regularization model.
+  // Create neighbor query and offset-based regularization model.
   Neighbor_query neighbor_query(segments);
   Offset_regularization offset_regularization(
     segments, CGAL::parameters::maximum_offset(max_offset_2));

Shape_regularization/examples/Shape_regularization/regularize_15_segments.cpp

@@ -54,7 +54,7 @@ int main(int argc, char *argv[]) {
   // Angle regularization.
   const FT max_angle_2 = FT(10);
 
-  // Create qp solver, neigbor query, and angle-based regularization model.
+  // Create qp solver, neighbor query, and angle-based regularization model.
   Quadratic_program qp_angles;
   Neighbor_query neighbor_query(segments);
   Angle_regularization angle_regularization(

Shape_regularization/examples/Shape_regularization/regularize_real_data_2.cpp

@@ -67,7 +67,7 @@ int main(int argc, char *argv[]) {
   // Angle regularization.
   const FT max_angle_2 = FT(80);
 
-  // Create neigbor query and angle-based regularization model.
+  // Create neighbor query and angle-based regularization model.
   Neighbor_query neighbor_query(segments);
   Angle_regularization angle_regularization(
     segments, CGAL::parameters::maximum_angle(max_angle_2));

Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h

@@ -223,7 +223,7 @@ class ConstructIsoRectangle_2
   public:
 
   /*!
-  introduces an iso-oriented rectangle fo whose minimal `x` coordinate
+  introduces an iso-oriented rectangle for whose minimal `x` coordinate
   is the one of `left`, the maximal `x` coordinate is the one of
   `right`, the minimal `y` coordinate is the one of `bottom`,
   the maximal `y` coordinate is the one of `top`.}