From 36c8b7589d6207e9a9be5841339c0ead7a3b70be Mon Sep 17 00:00:00 2001 From: albert-github Date: Fri, 31 May 2024 19:05:34 +0200 Subject: [PATCH] Spelling corrections Last batch (for now) of spelling corrections in doxygen and normal comments --- .../Boolean_set_operations_2.txt | 4 ++-- .../Gps_polygon_validation.h | 2 +- .../include/CGAL/connect_holes.h | 2 +- .../CGAL/Approximate_min_ellipsoid_d.h | 2 +- .../include/CGAL/pierce_rectangles_2.h | 22 +++++++++---------- CGAL_Core/include/CGAL/CORE/BigFloat.h | 2 +- CGAL_Core/include/CGAL/CORE/Filter.h | 2 +- .../CGAL_ipelets/nearest_neighbor_graph.cpp | 2 +- Cartesian_kernel/TODO | 2 +- .../benchmark/arrangement_traits/benchmark.h | 2 +- .../benchmark/bff_reader/readme.txt | 2 +- .../incremental_insertion/benchmark.h | 2 +- .../internal_functions_on_circular_arc_2.h | 2 +- .../intersecting_spheres.cpp | 4 ++-- .../Classification/gis_tutorial_example.cpp | 2 +- .../CGAL/Cone_spanners_2/Plane_scan_tree.h | 2 +- .../doc/Convex_hull_d/CGAL/Convex_hull_d.h | 2 +- .../Developer_manual/Chapter_handles.txt | 2 +- .../Developer_manual/Chapter_kernels.txt | 4 ++-- .../doc/Documentation/Getting_started.txt | 2 +- .../Envelope_3/CGAL/Env_triangle_traits_3.h | 2 +- Envelope_3/doc/Envelope_3/Envelope_3.txt | 4 ++-- .../Envelope_3/Envelope_element_visitor_3.h | 2 +- .../Envelope_3/Envelope_overlay_functor.h | 2 +- Filtered_kernel/TODO | 2 +- .../internal/Static_filters/Static_filters.h | 2 +- Generator/examples/Generator/README | 2 +- .../include/CGAL/L1_voronoi_traits_2.h | 2 +- GraphicsView/include/CGAL/Qt/camera_impl.h | 2 +- .../CGAL/Homogeneous/function_objects.h | 2 +- Hyperbolic_triangulation_2/TODO | 2 +- Installation/CHANGES.md | 2 +- .../cmake/modules/FindSuiteSparse.cmake | 4 ++-- Installation/lib/cmake/CGAL/CGALConfig.cmake | 2 +- .../Triangle_3_Triangle_3_intersection.h | 2 +- Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h | 2 +- .../include/Terminal_parser.h | 2 +- .../Kinetic_space_partition/description.txt | 2 +- .../long_description.txt | 2 +- .../Kinetic_surface_reconstruction.txt | 4 ++-- .../include/Terminal_parser.h | 2 +- .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp | 2 +- .../Classification/Classification_plugin.cpp | 6 ++--- Lab/demo/Lab/Plugins/Mesh_3/Volume_plane.h | 2 +- .../Scene_aff_transformed_point_set_item.cpp | 2 +- .../Lab/Plugins/PCA/Scene_edit_box_item.cpp | 2 +- Lab/demo/Lab/Scene.h | 2 +- .../Linear_cell_complex/CMakeLists.txt | 2 +- ...ear_cell_complex_3_incremental_builder.cpp | 2 +- Mesh_2/test/Mesh_2/test_meshing.cpp | 2 +- Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h | 2 +- Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h | 4 ++-- .../doc/Minkowski_sum_2/Minkowski_sum_2.txt | 4 ++-- .../AABB_collision_detector_2.h | 2 +- .../CGAL/Polygon_vertical_decomposition_2.h | 2 +- Nef_3/doc/Nef_3/CGAL/Nef_polyhedron_3.h | 4 ++-- .../include/CGAL/Nef_3/SNC_const_decorator.h | 2 +- Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h | 4 ++-- Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h | 2 +- Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h | 4 ++-- Number_types/include/CGAL/Mpzf.h | 2 +- .../CGAL/Sqrt_extension/Fraction_traits.h | 2 +- Number_types/test/Number_types/CORE_Expr.cpp | 2 +- .../mesh_periodic_polyhedral_domain.cpp | 2 +- ...Periodic_3_triangulation_dummy_generator.h | 2 +- .../include/CGAL/range_search_delaunay_2.h | 2 +- .../include/CGAL/scanline_orient_normals.h | 4 ++-- .../Poisson_implicit_surface_oracle_3.h | 2 +- .../Polygon_mesh_processing/fast.cpp | 2 +- ...c_remeshing_with_custom_sizing_example.cpp | 2 +- .../angle_and_area_smoothing.h | 2 +- .../CGAL/Polygon_mesh_processing/extrude.h | 4 ++-- .../internal/Corefinement/intersection_impl.h | 2 +- .../internal/Smoothing/mesh_smoothing_impl.h | 2 +- .../interpolated_corrected_curvatures.h | 4 ++-- .../remesh_planar_patches.h | 2 +- .../include/CGAL/Polyhedral_envelope.h | 2 +- .../test_is_polygon_soup_a_polygon_mesh.cpp | 2 +- .../polyhedron_self_intersection.cpp | 2 +- .../CGAL/Polyhedron_incremental_builder_3.h | 2 +- .../Polynomial/modular_gcd_utcf_algorithm_M.h | 2 +- .../polynomial_gcd_implementations.h | 2 +- .../include/CGAL/Polynomial/subresultants.h | 2 +- Polynomial/include/CGAL/Polynomial_traits_d.h | 2 +- Polytope_distance_d/include/CGAL/Width_3.h | 4 ++-- .../doc/Property_map/Property_map.txt | 2 +- .../include/CGAL/Property_container.h | 2 +- .../Property_map/test_Property_container.cpp | 2 +- QP_solver/include/CGAL/QP_functions.h | 4 ++-- .../CGAL/QP_solver/QP_functions_impl.h | 2 +- .../include/CGAL/QP_solver/QP_solver_impl.h | 2 +- .../include/CGAL/Handle_with_policy.h | 2 +- .../internal/boost/array_binary_tree.hpp | 2 +- STL_Extension/include/CGAL/algorithm.h | 2 +- .../Alpha_shape_mesher.h | 2 +- Scripts/developer_scripts/autotest_cgal | 2 +- .../sdg-advanced-draw.cpp | 2 +- .../Segment_Delaunay_graph_2_impl.h | 2 +- .../Vertex_conflict_C2.h | 4 ++-- .../Vertex_conflict_C2.h | 4 ++-- .../Least_squares_plane_fit_region.h | 2 +- .../include/CGAL/Snap_rounding_kd_2.h | 2 +- .../doc/Spatial_searching/CGAL/Kd_tree.h | 2 +- .../iso_rectangle_2_query_projection.cpp | 4 ++-- .../CGAL/extrude_skeleton.h | 2 +- .../Straight_skeleton_2.txt | 2 +- .../Straight_skeleton_builder_2_impl.h | 4 ++-- .../Straight_skeleton_cons_ftC2.h | 2 +- .../include/CGAL/extrude_skeleton.h | 4 ++-- .../description.txt | 2 +- .../Stream_support/long_description.txt | 2 +- .../ARAP_parameterizer_3.h | 2 +- .../MVC_post_processor_3.h | 8 +++---- .../Orbifold_Tutte_parameterizer_3.h | 2 +- .../edge_collapse.h | 2 +- .../Bounded_normal_change_filter.h | 2 +- .../Bounded_normal_change_placement.h | 2 +- .../test_self_intersection.h | 2 +- .../include/CGAL/draw_face_graph_with_paths.h | 2 +- .../fundamental_group_of_the_torus.cpp | 2 +- .../Implicit_surface_oracle_3.h | 2 +- .../include/CGAL/Surface_sweep_2.h | 4 ++-- .../CGAL/Surface_sweep_2/Event_comparer.h | 2 +- .../Surface_sweep_2/Surface_sweep_2_impl.h | 6 ++--- .../CGAL/Triangulation_data_structure_2.h | 6 ++--- .../include/CGAL/Triangulation_ds_vertex_2.h | 2 +- TDS_3/include/CGAL/Triangulation_utils_3.h | 2 +- .../Tetrahedral_remeshing.txt | 2 +- Three/include/CGAL/Three/Scene_group_item.h | 6 ++--- .../doc/Triangulation_2/Triangulation_2.txt | 2 +- .../include/CGAL/Triangulation_3.h | 12 +++++----- .../include/CGAL/_test_cls_regular_3.h | 2 +- .../CGAL/Delaunay_triangulation_on_sphere_2.h | 2 +- .../Voronoi_diagram_2/Voronoi_diagram_2.txt | 2 +- 134 files changed, 182 insertions(+), 182 deletions(-) diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Boolean_set_operations_2.txt b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Boolean_set_operations_2.txt index c2b9b311b2b1..d03add5708ad 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Boolean_set_operations_2.txt +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Boolean_set_operations_2.txt @@ -575,13 +575,13 @@ If the `UsePolylines` template parameter is substitited with
  • Instead of using an instance of the `Polygon_set_2` class template, as described above, an instance of the -`General_polygon_set_2` class template is used, which utilzes the +`General_polygon_set_2` class template is used, which utilizes the `Arr_polyline_traits_2` class template; see Section \ref arr_ssectr_polylines in the 2D Arrangements package.
  • Each input linear polygon (respectively linear polygon with holes) is converted into a general polygon (respectively general polygon with holes) -bounded by \f$x\f$-monotone polylines. Then, the resulting generl +bounded by \f$x\f$-monotone polylines. Then, the resulting general polygons, which are also bounded by \f$x\f$-monotone polylines, are converted back to standard polygons. diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h index 8f50cc8960ca..d5bcafcbdfc0 100644 --- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h +++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_polygon_validation.h @@ -691,7 +691,7 @@ bool are_holes_and_boundary_pairwise_disjoint bool intersect = gps.do_intersect(hole); if (intersect) return false; else { - /* to use gps.insert(hole) it is required that the set coponents and the + /* to use gps.insert(hole) it is required that the set components and the * new holes do not intersect. * because the sweep detects shared edges and the do_intersect query * detects 2D intersections we can safely use the insert(pwh) function diff --git a/Boolean_set_operations_2/include/CGAL/connect_holes.h b/Boolean_set_operations_2/include/CGAL/connect_holes.h index 8ae06574970a..b1dad76abade 100644 --- a/Boolean_set_operations_2/include/CGAL/connect_holes.h +++ b/Boolean_set_operations_2/include/CGAL/connect_holes.h @@ -48,7 +48,7 @@ struct _Less_handle /*! * Connect the given polygon with holes, turning it into a sequence of - * points, where the holes are connceted to the outer boundary using + * points, where the holes are connected to the outer boundary using * zero-width passages. * For example: * Input Output diff --git a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d.h b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d.h index 90bda509b4ba..b7b8fe03ea74 100644 --- a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d.h +++ b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d.h @@ -195,7 +195,7 @@ namespace CGAL { // where alpha = (1+a_eps)(d+1) with a_eps the return value // of achieved_epsilon(). // - // The ellipsoid E* we actuallly want is the intersection of E' with + // The ellipsoid E* we actually want is the intersection of E' with // the hyperplane { (y,z) in R^{d+1} | y = 1}. Writing // // [ M' m ] [ y ] diff --git a/Bounding_volumes/include/CGAL/pierce_rectangles_2.h b/Bounding_volumes/include/CGAL/pierce_rectangles_2.h index 8a7f3560a388..f33964389dac 100644 --- a/Bounding_volumes/include/CGAL/pierce_rectangles_2.h +++ b/Bounding_volumes/include/CGAL/pierce_rectangles_2.h @@ -794,7 +794,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) if (d.is_middle_empty()) { // now try to position the bottom piercing point in each - // of the intervalls formed by S_bt and S_br + // of the intervals formed by S_bt and S_br // (no need to consider S_bl, since we move from left // to right and leaving a rectangle won't make piercing easier) @@ -813,7 +813,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) Citerator br = d.brstc_begin(); Citerator rt = d.rtstc_begin(); - // make sure the top intervall is covered (left endpoint) + // make sure the top interval is covered (left endpoint) // (it might be that top_i.first determines the placement of // the top square) Point_2 top = top_i.first; @@ -826,14 +826,14 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) if (tl != d.tlstc_end()) { for (;;) { - // make sure the top intervall is covered (right endpoint) + // make sure the top interval is covered (right endpoint) if (sdistx(top_i.second, top) > FT(2) * d.r) break; // compute position of left square Point_2 left = lessy(left_i.second, *tl) ? *tl : left_i.second; - // make sure the left intervall is covered + // make sure the left interval is covered if (sdisty(left, left_i.first) <= FT(2) * d.r) { // compute position of bottom square @@ -844,7 +844,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) break; Point_2 bottom = lessx(bottom_i.first, *lb) ? bottom_i.first : *lb; - // check the shared x-intervall + // check the shared x-interval if (!share.empty() && d.is_x_greater_y()) { // compute position of top in share #ifndef _MSC_VER @@ -862,7 +862,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) sdistx(*(shl - 1), top) > FT(2) * d.r) --shl; - // make sure shared intervall is covered (left endpoint) + // make sure shared interval is covered (left endpoint) #ifndef _MSC_VER if ((shf != share.begin() || shl == share.end()) && lessx(share.front(), bottom)) @@ -881,7 +881,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) } - // make sure the bottom and the shared intervall (right endpoint) + // make sure the bottom and the shared interval (right endpoint) // are covered #ifndef _MSC_VER if (sdistx(bottom_i.second, bottom) <= FT(2) * d.r && @@ -907,7 +907,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) break; Point_2 right = lessy(right_i.first, *br) ? right_i.first : *br; - // check the shared y-intervall + // check the shared y-interval if (!share.empty() && !d.is_x_greater_y()) { // compute position of left in share #ifndef _MSC_VER @@ -926,7 +926,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) lessy(left, *(shl - 1))) --shl; - // make sure shared intervall is covered (bottom endpoint) + // make sure shared interval is covered (bottom endpoint) #ifndef _MSC_VER if ((shf != share.begin() || shl == share.end()) && lessy(share.front(), right)) @@ -945,7 +945,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) } - // make sure the right intervall and the shared intervall + // make sure the right interval and the shared interval // (top endpoint) are covered #ifndef _MSC_VER if (sdisty(right_i.second, right) <= FT(2) * d.r && @@ -985,7 +985,7 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok) } // if (sdisty(right_i.second, right) <= FT(2) * d.r) - } // if (bottom and shared intervall are covered) + } // if (bottom and shared interval are covered) } // if (sdisty(left, left_i.first) <= FT(2) * d.r) diff --git a/CGAL_Core/include/CGAL/CORE/BigFloat.h b/CGAL_Core/include/CGAL/CORE/BigFloat.h index de9ed2f55089..5b1bd138bca2 100644 --- a/CGAL_Core/include/CGAL/CORE/BigFloat.h +++ b/CGAL_Core/include/CGAL/CORE/BigFloat.h @@ -332,7 +332,7 @@ class CGAL_CORE_EXPORT BigFloat : public RCBigFloat { return rep->clLgErr(); } - /// division with relative precsion r + /// division with relative precision r BigFloat div(const BigFloat& x, const extLong& r) const { BigFloat y; y.rep->div(*rep, *x.rep, r); diff --git a/CGAL_Core/include/CGAL/CORE/Filter.h b/CGAL_Core/include/CGAL/CORE/Filter.h index e71c8aa8733f..96064b403b40 100644 --- a/CGAL_Core/include/CGAL/CORE/Filter.h +++ b/CGAL_Core/include/CGAL/CORE/Filter.h @@ -92,7 +92,7 @@ class filteredFp { CGAL_CORE_finite(fpVal) && // Test for infinite and NaNs (core_abs(fpVal) >= maxAbs*ind*CORE_EPS)); } - /// return the sign of fitered value. + /// return the sign of filtered value. /** (Note: must call isOK() to check whether the sign is ok before call this function.) */ int sign() const { diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp index 32cec4460dd4..bf1954cf307a 100644 --- a/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp +++ b/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp @@ -68,7 +68,7 @@ void nngIpelet::protected_run(int fn) ++v){ std::vector kNN; - CGAL::nearest_neighbors(t, v, kNeighbors+1, std::back_inserter(kNN)); // +1 as v itself counts as its nearest neigbhor for CGAL::nearest_neighbors + CGAL::nearest_neighbors(t, v, kNeighbors+1, std::back_inserter(kNN)); // +1 as v itself counts as its nearest neighbor for CGAL::nearest_neighbors for(const auto & nn : kNN) { if(v->point() != nn->point()) { diff --git a/Cartesian_kernel/TODO b/Cartesian_kernel/TODO index a290949e9e75..18b6330fa76c 100644 --- a/Cartesian_kernel/TODO +++ b/Cartesian_kernel/TODO @@ -3,7 +3,7 @@ Stuff to look at, as time permits: - Why Ray_3 and Line_3 don't have the same internal representation ??? -- Triangle-Triangle instersection (and predicate) : +- Triangle-Triangle intersection (and predicate) : Tomas Möller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25-30, 1997 A Fast Triangle-Triangle Intersection Test, tompa@clarus.se diff --git a/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h b/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h index 216e670bfc74..b5689f4b469d 100644 --- a/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h +++ b/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h @@ -210,7 +210,7 @@ class Bench Pmwx _pm; Point_location _pl(_pm); - std::cout << "Construction complited"<start(); diff --git a/Circular_kernel_2/benchmark/bff_reader/readme.txt b/Circular_kernel_2/benchmark/bff_reader/readme.txt index 8693d1544107..c963806d6980 100644 --- a/Circular_kernel_2/benchmark/bff_reader/readme.txt +++ b/Circular_kernel_2/benchmark/bff_reader/readme.txt @@ -1,6 +1,6 @@ It's not finished reader off .bff it uses extended version of parser. I hope it will be useful for yours future works. By using -this source you can easyly create yours own. +this source you can easily create yours own. missing Circular-arc diff --git a/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h b/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h index bb1e534e73b9..27acf6e3764e 100644 --- a/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h +++ b/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h @@ -212,7 +212,7 @@ class Bench Pmwx _pm; Point_location _pl(_pm); - std::cout << "Construction complited"<start(); for (typename ArcContainer::const_iterator it=ac.begin(); diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h index 1e577eea5b3a..b5830954ec7a 100644 --- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h +++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h @@ -1453,7 +1453,7 @@ template < class CK, class OutputIterator > // returns extra information, descriptive of the position of the returned // xy-monotone arcs on the circle: The output iterator refers to pairs, the // first part of which is the object containing the arc and the second part -// is another pair containing 2 booleans which equavalently describe whether the +// is another pair containing 2 booleans which equivalently describe whether the // returned xy-monotone arc is on the upper part and the left side of the circle template < typename CK , typename Output_iterator> diff --git a/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp b/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp index a31eef6daf38..a53f4f7f29f0 100644 --- a/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp +++ b/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp @@ -15,8 +15,8 @@ int main() { CGAL::Random theRandom(random_seed); int count = 0; - std::cout << "We will compute the approximate probability that 3 spheres wit" - << "h radius 1 intersect on a 5x5x5 box, it might take some time." << std::endl; + std::cout << "We will compute the approximate probability that 3 spheres with" + << " radius 1 intersect on a 5x5x5 box, it might take some time." << std::endl; for(int i=0; i<10000; i++) { diff --git a/Classification/examples/Classification/gis_tutorial_example.cpp b/Classification/examples/Classification/gis_tutorial_example.cpp index c1bbc20a4d42..ad81fc3ee27d 100644 --- a/Classification/examples/Classification/gis_tutorial_example.cpp +++ b/Classification/examples/Classification/gis_tutorial_example.cpp @@ -470,7 +470,7 @@ int main (int argc, char** argv) } } - // Fill all holes except the bigest (which is the outer hull of the mesh) + // Fill all holes except the biggest (which is the outer hull of the mesh) for (Mesh::Halfedge_index hi : holes) if (hi != outer_hull) CGAL::Polygon_mesh_processing::triangulate_refine_and_fair_hole diff --git a/Cone_spanners_2/include/CGAL/Cone_spanners_2/Plane_scan_tree.h b/Cone_spanners_2/include/CGAL/Cone_spanners_2/Plane_scan_tree.h index 2584d72ae2c0..66de14eecc2c 100644 --- a/Cone_spanners_2/include/CGAL/Cone_spanners_2/Plane_scan_tree.h +++ b/Cone_spanners_2/include/CGAL/Cone_spanners_2/Plane_scan_tree.h @@ -100,7 +100,7 @@ class Plane_scan_tree { : less (comp), vless (vcomp), root (nullptr), m_min (nullptr), m_max (nullptr), _size (0) { - // buids the tree + // builds the tree /* Note: a more efficient algorithm building the tree bottom up may be worth implementing later */ for (; first != last; ++first) diff --git a/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h b/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h index aa1d645b3457..7ebe0f215298 100644 --- a/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h +++ b/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h @@ -352,7 +352,7 @@ void print_statistics() ; /*! checks the -validity of the data structure. If `throw_exceptions == thrue` +validity of the data structure. If `throw_exceptions == true` then the program throws the following exceptions to inform about the problem. `chull_has_center_on_wrong_side_of_hull_facet` the diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_handles.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_handles.txt index e93fd1179c77..9caa0f252035 100644 --- a/Documentation/doc/Documentation/Developer_manual/Chapter_handles.txt +++ b/Documentation/doc/Documentation/Developer_manual/Chapter_handles.txt @@ -144,7 +144,7 @@ shared with other `My_geo_object` objects. \section Developer_manualTemplatedhandles Templated handles -Factoring out the common functionality in base classes enables re-use of +Factoring out the common functionality in base classes enables reuse of the code, but there is also a major drawback. The `Handle` class does not know the type of the representation object. It maintains a `Rep*` pointer. Therefore, this pointer must be cast to a pointer to the actual type diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt index 78706045ef77..c665ec1f8905 100644 --- a/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt +++ b/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt @@ -92,7 +92,7 @@ the same object with opposite orientation. For a number of predicates, there are versions that operate on the coordinates directly, not on the geometric objects. These -number-type based predicates ease re-use with non-CGAL types. +number-type based predicates ease reuse with non-CGAL types. \section secNewKernelTraits Missing functionality @@ -103,7 +103,7 @@ with a different API, then one should really implement the functionality and the others call that one. Whenever you need a predicate that is not present in the current kernel -traits, you should first try to re-use the available predicates (you +traits, you should first try to reuse the available predicates (you might rewrite the code or implement the new predicate using existing ones). If this is not feasible (especially for efficiency reasons), we have to decide on adding the new predicate to the kernel traits. diff --git a/Documentation/doc/Documentation/Getting_started.txt b/Documentation/doc/Documentation/Getting_started.txt index 71d5f9b9e7ad..5bb9d0f56a35 100644 --- a/Documentation/doc/Documentation/Getting_started.txt +++ b/Documentation/doc/Documentation/Getting_started.txt @@ -7,7 +7,7 @@ The following pages describe how to use \cgal on different environments: - \subpage windows -- \subpage thirdparty gives information (supported versions, download links) of the required and optional third party libraries. +- \subpage thirdparty gives information (supported versions, download links) of the required and optional third-party libraries. - \subpage devman_create_and_use_a_cmakelist explains how to use CMake to link a program with \cgal. diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h index 30cbba6d6421..9956191905bc 100644 --- a/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h +++ b/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h @@ -24,7 +24,7 @@ namespace CGAL { * two triangles, onto the \f$ xy\f$-plane, we obtain line segments. Indeed, * `Env_triangle_traits_3` inherits from the traits class that substitutes * `ArrSegmentTraits`, and extends it by adding operations on 3D objects, namely - * spacial triangles. Note that the traits class does not define + * spatial triangles. Note that the traits class does not define * `Kernel::Triangle_3` as its surface (and \f$ xy\f$-monotone surface) type, as * one may expect. This is because the traits class needs to store extra data * with the triangles in order to efficiently operate on them. Nevertheless, diff --git a/Envelope_3/doc/Envelope_3/Envelope_3.txt b/Envelope_3/doc/Envelope_3/Envelope_3.txt index f87ee9b91274..6921d5e10dec 100644 --- a/Envelope_3/doc/Envelope_3/Envelope_3.txt +++ b/Envelope_3/doc/Envelope_3/Envelope_3.txt @@ -97,9 +97,9 @@ of planar arrangements, the `EnvelopeTraits_3` refines the concept must define the planar types `Point_2` and `X_monotone_curve_2` and support basic operations on them, as listed in Section \ref aos_sec-geom_traits. Moreover, it must define the -spacial types `Surface_3` and `Xy_monotone_surface_3` (in practice, +spatial types `Surface_3` and `Xy_monotone_surface_3` (in practice, these two types may be the same). Any model of the envelope-traits -concept must also support the following operations on these spacial +concept must also support the following operations on these spatial types: \cgalFigureAnchor{env3_figcomp_over} diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h index 815b23f6cc25..d092f5a58cc5 100644 --- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h +++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h @@ -2067,7 +2067,7 @@ class Envelope_element_visitor_3 { v2_is_new = true; } - // now use the approppriate method to insert the new edge + // now use the appropriate method to insert the new edge if (v1_is_new && v2_is_new) { // if both vertices are new - use the O(1) operation // _insert_in_face_interior (in the face mapped to by he->face()) diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h index 6b7c6cba6747..126629c41e9b 100644 --- a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h +++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h @@ -311,7 +311,7 @@ class Envelope_overlay_functor { Halfedge_handle hh = vc; // update the map traversed_vertices[Vertex_face_pair(v, hh->face())] = hh; - // check for reult + // check for result if (hh->face() == f) result = hh; } while (++vc != vc_begin); } diff --git a/Filtered_kernel/TODO b/Filtered_kernel/TODO index 5d1cecd89623..e8d36f278b21 100644 --- a/Filtered_kernel/TODO +++ b/Filtered_kernel/TODO @@ -166,7 +166,7 @@ class Filtered_Point_2 #endif }; -// For filtered constructions, we should be able to re-use the same predicates, +// For filtered constructions, we should be able to reuse the same predicates, // but have different constructions and objects Point_2... template > class Filtered_kernel diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h index a927eb809581..04456597083c 100644 --- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h +++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h @@ -84,7 +84,7 @@ // - others ? // - benchmark on more algorithms. // - improve fit_in_double() for other NTs (MP_Float, Lazy). cf tools.h. -// - try to automatize : have a struct a la Static_filter_error, with one part +// - try to automate : have a struct a la Static_filter_error, with one part // which is runtime, and the other which can be constant-propagated by the // compiler. g++ 4.0 should be able to cprop the second part... diff --git a/Generator/examples/Generator/README b/Generator/examples/Generator/README index 8bf916628f1a..e6c25f358eb8 100644 --- a/Generator/examples/Generator/README +++ b/Generator/examples/Generator/README @@ -45,7 +45,7 @@ ball_d.cpp generates random points within an hyper ball in dim d. cube_d.cpp - generates random points wthin an hyper cube in dim d. + generates random points within an hyper cube in dim d. grid_d.cpp generates points on a grid in dim d. diff --git a/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h b/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h index e7d9b163a4c7..33b7a5eaee5e 100644 --- a/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h +++ b/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h @@ -115,7 +115,7 @@ class L1_voronoi_traits_2 : public Arr_linear_traits_2 if (l.is_vertical()) { // Could be a tie. - // To be "above" the curve, we acutually need to have smaller x coordinate, + // To be "above" the curve, we actually need to have smaller x coordinate, // the order of the comparison function here is opposite to the none vertical // case. side = CGAL::opposite(side); diff --git a/GraphicsView/include/CGAL/Qt/camera_impl.h b/GraphicsView/include/CGAL/Qt/camera_impl.h index bded07f76926..2997b4778e45 100644 --- a/GraphicsView/include/CGAL/Qt/camera_impl.h +++ b/GraphicsView/include/CGAL/Qt/camera_impl.h @@ -155,7 +155,7 @@ since the latter automatically updates these values when it is resized (hence overwriting your values). Non-positive dimension are silently replaced by a 1 pixel value to ensure -frustrum coherence. +frustum coherence. If your Camera is used without a CGAL::QGLViewer (offscreen rendering, shadow maps), use setAspectRatio() instead to define the projection matrix. */ diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h b/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h index 3028950d7aff..b88aab964dcc 100644 --- a/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h +++ b/Homogeneous_kernel/include/CGAL/Homogeneous/function_objects.h @@ -189,7 +189,7 @@ namespace HomogeneousKernelFunctors { // want to solve alpha*v1 + beta*v2 + gamma*v3 == vp // let vi' == vi*vi.hw() // we solve alpha'*v1' + beta'*v2' + gamma'*v3' == vp' / vp.hw() - // muliplied by vp.hw() + // multiplied by vp.hw() // then we have alpha = alpha'*v1.hw() / vp.hw() // and beta = beta' *v2.hw() / vp.hw() // and gamma = gamma'*v3.hw() / vp.hw() diff --git a/Hyperbolic_triangulation_2/TODO b/Hyperbolic_triangulation_2/TODO index 0bc3cc547d98..f38377d24925 100644 --- a/Hyperbolic_triangulation_2/TODO +++ b/Hyperbolic_triangulation_2/TODO @@ -17,7 +17,7 @@ understand why remove variant for supporting circle or line of bisector call it only when we know that it is a circle -it will simplyfy the code of Construct_hyperbolic_bisector_2 at least in some cases +it will simplify the code of Construct_hyperbolic_bisector_2 at least in some cases test bisectors dual functions in special cases of euclidean line segments diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md index 6c8befb902bc..6383e7fae0b8 100644 --- a/Installation/CHANGES.md +++ b/Installation/CHANGES.md @@ -4933,7 +4933,7 @@ CGAL now works around the preprocessor macros 'min' and 'max' defined in allows users to extend the DCEL of the underlying arrangement. - Added a function template called connect\_holes() that connects the holes in a given polygon with holes, turning it into a - sequence of points, where the holes are connceted to the outer + sequence of points, where the holes are connected to the outer boundary using zero-width passages. - Added a non-const function member to General\_polygon\_set\_2 that obtains the underlying arrangement. diff --git a/Installation/cmake/modules/FindSuiteSparse.cmake b/Installation/cmake/modules/FindSuiteSparse.cmake index a58cdefdfcc6..1782083e294c 100644 --- a/Installation/cmake/modules/FindSuiteSparse.cmake +++ b/Installation/cmake/modules/FindSuiteSparse.cmake @@ -139,10 +139,10 @@ macro(SuiteSparse_FIND_COMPONENTS ) ## special check for suitesparse component (allow to find on windows but not on linux because doesn't exist) list(FIND SuiteSparse_FIND_COMPONENTS "suitesparse" ss_index) if(${ss_index} MATCHES "-1") - ## do nothing, the user didn't provide the suisparse componnent + ## do nothing, the user didn't provide the suisparse component else() if(WIN32) - ## do nothing, the user provide the suisparse componnent we will try to find + ## do nothing, the user provide the suisparse component we will try to find else() list(REMOVE_AT SuiteSparse_FIND_COMPONENTS ${ss_index}) if(SuiteSparse_VERBOSE) diff --git a/Installation/lib/cmake/CGAL/CGALConfig.cmake b/Installation/lib/cmake/CGAL/CGALConfig.cmake index 0ebd009ac8d8..81f84153ddec 100644 --- a/Installation/lib/cmake/CGAL/CGALConfig.cmake +++ b/Installation/lib/cmake/CGAL/CGALConfig.cmake @@ -214,6 +214,6 @@ if ( NOT "${CGAL_CMAKE_EXACT_NT_BACKEND}" STREQUAL "Default" ) TARGET CGAL APPEND PROPERTY INTERFACE_COMPILE_DEFINITIONS "CMAKE_OVERRIDDEN_DEFAULT_ENT_BACKEND=${DEB_VAL}" - ) # do not use set_target_properties to avoid overwritting + ) # do not use set_target_properties to avoid overwriting endif() diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h index 471904cd97ab..a70bf84ad795 100644 --- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h +++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h @@ -142,7 +142,7 @@ struct Point_on_triangle } }; -// the intersection of two triangles is computed by interatively intersection t2 +// the intersection of two triangles is computed by iteratively intersection t2 // with halfspaces defined by edges of t1. The following function is called // for each each on t1 on edge of the current intersection. // pq is such an edge and p1q1 from t1 defines the halfspace intersection diff --git a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h index 6af609250b87..eee115731e18 100644 --- a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h +++ b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h @@ -92,7 +92,7 @@ Bounded_side bounded_side(const Point_3 &p) const; /// @} -/// \name Convencience Boolean Functions +/// \name Convenience Boolean Functions /// @{ /*! diff --git a/Kinetic_space_partition/examples/Kinetic_space_partition/include/Terminal_parser.h b/Kinetic_space_partition/examples/Kinetic_space_partition/include/Terminal_parser.h index f009abf03e1e..2011d6508714 100644 --- a/Kinetic_space_partition/examples/Kinetic_space_partition/include/Terminal_parser.h +++ b/Kinetic_space_partition/examples/Kinetic_space_partition/include/Terminal_parser.h @@ -149,7 +149,7 @@ namespace KSR { std::cout << "parameter name: -silent" << std::endl << - "description: supress any intermediate output except for the final result" << std::endl << std::endl; + "description: suppress any intermediate output except for the final result" << std::endl << std::endl; std::cout << "parameter name: -params" << std::endl << diff --git a/Kinetic_space_partition/package_info/Kinetic_space_partition/description.txt b/Kinetic_space_partition/package_info/Kinetic_space_partition/description.txt index f1a7576f3cb9..2c329ae32c8c 100644 --- a/Kinetic_space_partition/package_info/Kinetic_space_partition/description.txt +++ b/Kinetic_space_partition/package_info/Kinetic_space_partition/description.txt @@ -1,4 +1,4 @@ Kinetic Shape Partition This CGAL package provides a way to partition 2D or 3D space by propagating -2D segments or 3D polygons until they interesect the predefined number of times. +2D segments or 3D polygons until they intersect the predefined number of times. diff --git a/Kinetic_space_partition/package_info/Kinetic_space_partition/long_description.txt b/Kinetic_space_partition/package_info/Kinetic_space_partition/long_description.txt index 520f26605bfc..d17b005140f2 100644 --- a/Kinetic_space_partition/package_info/Kinetic_space_partition/long_description.txt +++ b/Kinetic_space_partition/package_info/Kinetic_space_partition/long_description.txt @@ -2,5 +2,5 @@ Kinetic Shape Partition This CGAL package provides a way to partition 2D or 3D space by propagating 2D segments or 3D polygons until they intersect the predefined number of times. -Once the partion is found, a 3D shape can be reconstructed by utilizing a graph cut approach. +Once the partition is found, a 3D shape can be reconstructed by utilizing a graph cut approach. The final result is a piece-wise linear approximation of the given smooth shape. diff --git a/Kinetic_surface_reconstruction/doc/Kinetic_surface_reconstruction/Kinetic_surface_reconstruction.txt b/Kinetic_surface_reconstruction/doc/Kinetic_surface_reconstruction/Kinetic_surface_reconstruction.txt index 09d7c3dc4889..08cb4000e2f5 100644 --- a/Kinetic_surface_reconstruction/doc/Kinetic_surface_reconstruction/Kinetic_surface_reconstruction.txt +++ b/Kinetic_surface_reconstruction/doc/Kinetic_surface_reconstruction/Kinetic_surface_reconstruction.txt @@ -36,7 +36,7 @@ The reconstruction is posed as an energy minimization labeling the convex volume -The labels \f$l \in {\{0, 1\}}^n\f$ denote the label for the \f$n\f$ volumes of the kinetic space partition. The data term measures the coherence of the labeled volumes with the orientation of normals of the input points. The prefered label for a volume is determined by a voting of the input points and their associated normals. +The labels \f$l \in {\{0, 1\}}^n\f$ denote the label for the \f$n\f$ volumes of the kinetic space partition. The data term measures the coherence of the labeled volumes with the orientation of normals of the input points. The preferred label for a volume is determined by a voting of the input points and their associated normals. For each volume \f$i \in C\f$ the inliers from the shape detection associated with the faces of the volume \f$I_i\f$ either vote inside or outside for the volume. The vote is inside \f$d_i(p, inside) = 1\f$ and \f$d_i(p, outside = 0)\f$ if the normal associated to the point is directed to the outwards of the volume or outside \f$d_i(p, inside) = 0\f$ and \f$d_i(p, outside = 1)\f$ if the normal is oriented inwards. The regularization term is penalizing the total surface area of the surface and thus favoring less complex surfaces. To put the data term and regularization term into balance, area of each face is normalized by the total area of all faces \f$A\f$ and scaled by twice the total number of inliners \f$I\f$ from the shape detection as each inlier counts as one *inside* and one *outside* vote. @@ -62,7 +62,7 @@ The reconstruction adds two new parameters: The min-cut formulation embeds a vertex into each volume and connects all vertices if the corresponding volumes share a common face. While each face inside the kinetic space partition is exactly between two volumes, faces on the boundary do not. Thus, 6 external vertices are inserted into the graph representing a volume on each side of the bounding box. The parameter *external_nodes* allows the user to either provide a fixed label *inside* or *outside* for each node or leave the label up to the energy minimization. Typical choices for this parameter are to choose all external nodes as outside for scanned objects, e.g., as in \cgalFigureRef{Ksr_pipelinefig}, or the *ZMIN* node *inside* and all other nodes *outside* as for exterior scans of buildings, e.g., as in \cgalFigureRef{Ksr_parametersfig}. The default value for this parameter is to leave the labels of the external nodes up to the energy minimization. The alternative method `reconstruct_with_ground` estimates a ground plane within the detected shapes and sets up all faces on the bounding box below that ground plane to be connected to an external node set as *inside* while all other faces on the outside are connected to external nodes set to *outside*. It assumes the z-axis to be the upward pointing vertical direction. - *lambda*: -The *lambda* parameter trades the data faithfulness of the energy minimization for low complexity. The parameter has to be choosen in the range of \f$[0,1)\f$. \f$0\f$ indicates maximal data faithfulness, while the default value of \f$0.5\f$ gives an equal weight to data faithfulness and low complexity. The value should be choosen according to the quality of the input data. If the point cloud is accurate, low in noise and complete a low value can be chosen. +The *lambda* parameter trades the data faithfulness of the energy minimization for low complexity. The parameter has to be chosen in the range of \f$[0,1)\f$. \f$0\f$ indicates maximal data faithfulness, while the default value of \f$0.5\f$ gives an equal weight to data faithfulness and low complexity. The value should be chosen according to the quality of the input data. If the point cloud is accurate, low in noise and complete a low value can be chosen. \section ksrParameterChoice Choice of Parameters The kinetic space partition determines all possible reconstructions as the energy formulation only decides about the labels for the volumes, but cannot change the volumes themselves. Thus, the first stages of the pipeline, \ref PkgShapeDetection "Shape Detection" and \ref PkgShapeRegularization "Shape Regularization", have a large impact on the final reconstruction. In the simple case of a cube, one missing side would depending on the chosen *lambda* parameter either make the cube expand on that side towards the bounding box or make the full cube disappear. A proper parameterization of the \ref PkgShapeDetection "Shape Detection" to detect all relevant shapes may have a large impact. The *debug* parameter allows to export intermediate results for inspection. This is especially helpful for larger scenes, where the time for the whole reconstruction requires more computational effort. diff --git a/Kinetic_surface_reconstruction/examples/Kinetic_surface_reconstruction/include/Terminal_parser.h b/Kinetic_surface_reconstruction/examples/Kinetic_surface_reconstruction/include/Terminal_parser.h index f2f618e3227c..248abe895c0f 100644 --- a/Kinetic_surface_reconstruction/examples/Kinetic_surface_reconstruction/include/Terminal_parser.h +++ b/Kinetic_surface_reconstruction/examples/Kinetic_surface_reconstruction/include/Terminal_parser.h @@ -149,7 +149,7 @@ namespace KSR { std::cout << "parameter name: -silent" << std::endl << - "description: supress any intermediate output except for the final result" << std::endl << std::endl; + "description: suppress any intermediate output except for the final result" << std::endl << std::endl; std::cout << "parameter name: -params" << std::endl << diff --git a/Lab/demo/Lab/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Lab/demo/Lab/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp index 0ab0d872c887..3374d7fe619f 100644 --- a/Lab/demo/Lab/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp +++ b/Lab/demo/Lab/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp @@ -53,7 +53,7 @@ using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3; // - The visitor has a shared pointer to an emiter (can't emit directly from the visitor) // - The visitor has shared pointers to a polygon soup (+ colors), which it updates itself // before emitting a signal -// - There is a pause in the emition because it needs to wait for the main thread to draw the +// - There is a pause in the starting of the thread because it needs to wait for the main thread to draw the // polygon soup before the visitor updates the polygon soup. struct Iterative_update_emiter diff --git a/Lab/demo/Lab/Plugins/Classification/Classification_plugin.cpp b/Lab/demo/Lab/Plugins/Classification/Classification_plugin.cpp index d75cf0e3f73c..bb02daf1655b 100644 --- a/Lab/demo/Lab/Plugins/Classification/Classification_plugin.cpp +++ b/Lab/demo/Lab/Plugins/Classification/Classification_plugin.cpp @@ -643,7 +643,7 @@ public Q_SLOTS: QString filename; int classifier = get_classifier(); - if (classifier == CGAL_CLASSIFICATION_SOWF_NUMBER) // Sum of Weighted Featuers + if (classifier == CGAL_CLASSIFICATION_SOWF_NUMBER) // Sum of Weighted Features filename = QFileDialog::getSaveFileName(mw, tr("Save classification configuration"), tr("%1 (CGAL classif config).xml").arg(classif->item()->name()), @@ -690,7 +690,7 @@ public Q_SLOTS: QString filename; int classifier = get_classifier(); - if (classifier == CGAL_CLASSIFICATION_SOWF_NUMBER) // Sum of Weighted Featuers + if (classifier == CGAL_CLASSIFICATION_SOWF_NUMBER) // Sum of Weighted Features filename = QFileDialog::getOpenFileName(mw, tr("Open CGAL classification configuration"), ".", @@ -1321,7 +1321,7 @@ public Q_SLOTS: QMultipleInputDialog dialog ("Train Classifier", mw); int classifier = get_classifier(); - if (classifier == CGAL_CLASSIFICATION_SOWF_NUMBER) // Sum of Weighted Featuers + if (classifier == CGAL_CLASSIFICATION_SOWF_NUMBER) // Sum of Weighted Features { QSpinBox* trials = dialog.add ("Number of trials: ", "trials"); trials->setRange (1, 99999); diff --git a/Lab/demo/Lab/Plugins/Mesh_3/Volume_plane.h b/Lab/demo/Lab/Plugins/Mesh_3/Volume_plane.h index 6dbe84a28e81..a5399210b43f 100644 --- a/Lab/demo/Lab/Plugins/Mesh_3/Volume_plane.h +++ b/Lab/demo/Lab/Plugins/Mesh_3/Volume_plane.h @@ -279,7 +279,7 @@ private : QString name(z_tag) const { return tr("Z Slice for %2").arg(name_); } //according to the tag, a,b,c dim change but not the scale. We look for the max dimension of the whole image. - //A high scale factor will often go with a low dimesion, to compensate it. So we don't want a max being the + //A high scale factor will often go with a low dimension, to compensate it. So we don't want a max being the //higher scale * the higher dim, hence the tag specialisation. //TODO: set the scale factors according to the dimensipon to avoid doing that. double compute_maxDim(x_tag) const diff --git a/Lab/demo/Lab/Plugins/PCA/Scene_aff_transformed_point_set_item.cpp b/Lab/demo/Lab/Plugins/PCA/Scene_aff_transformed_point_set_item.cpp index ebf07545f440..a103c56fd520 100644 --- a/Lab/demo/Lab/Plugins/PCA/Scene_aff_transformed_point_set_item.cpp +++ b/Lab/demo/Lab/Plugins/PCA/Scene_aff_transformed_point_set_item.cpp @@ -8,7 +8,7 @@ using namespace CGAL::Three; -// const std::size_t limit_fast_drawing = 300000; //arbitraty large value +// const std::size_t limit_fast_drawing = 300000; //arbitrary large value Scene_aff_transformed_point_set_item:: Scene_aff_transformed_point_set_item(Scene_points_with_normal_item* pts_item, diff --git a/Lab/demo/Lab/Plugins/PCA/Scene_edit_box_item.cpp b/Lab/demo/Lab/Plugins/PCA/Scene_edit_box_item.cpp index af7ae5a31459..d05f67c9a41c 100644 --- a/Lab/demo/Lab/Plugins/PCA/Scene_edit_box_item.cpp +++ b/Lab/demo/Lab/Plugins/PCA/Scene_edit_box_item.cpp @@ -322,7 +322,7 @@ QString Scene_edit_box_item::toolTip() const { QMenu* Scene_edit_box_item::contextMenu() { - // diasable "Alpha slider" in menu + // disable "Alpha slider" in menu QMenu* resMenu = Scene_item::contextMenu(); bool prop = property("menu_changed").toBool(); if(!prop) diff --git a/Lab/demo/Lab/Scene.h b/Lab/demo/Lab/Scene.h index 2d0a0cb2c7c9..dd19bc27cd86 100644 --- a/Lab/demo/Lab/Scene.h +++ b/Lab/demo/Lab/Scene.h @@ -118,7 +118,7 @@ class SCENE_EXPORT Scene : //Contains the text and icons of an item in the Geometric Objects view QVariant data ( const QModelIndex & index, int role = ::Qt::DisplayRole ) const override; - //@returns the type of data correspondind to the role. + //@returns the type of data corresponding to the role. QVariant headerData ( int section, ::Qt::Orientation orientation, int role = ::Qt::DisplayRole ) const override; //@returns the flags for the item at the target index. diff --git a/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt index e3c32160e7bd..acc1cacd7e6d 100644 --- a/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt +++ b/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt @@ -10,7 +10,7 @@ find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6) # ADD_DEFINITIONS("-pg") # set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -pg") -# To use valgrind, we must disable rounding math ckeck. +# To use valgrind, we must disable rounding math check. # add_definitions(-DCGAL_DISABLE_ROUNDING_MATH_CHECK) create_single_source_cgal_program("gmap_linear_cell_complex_3.cpp") diff --git a/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_incremental_builder.cpp b/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_incremental_builder.cpp index 414be85978a2..70f649f2a386 100644 --- a/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_incremental_builder.cpp +++ b/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_incremental_builder.cpp @@ -30,7 +30,7 @@ int main() ib.add_facet({5,4,7,6}); ib.begin_facet(); // Create a new facet version 2: begin facet - ib.add_vertex_to_facet(0); // add sucessively its indices + ib.add_vertex_to_facet(0); // add successively its indices ib.add_vertex_to_facet(3); ib.add_vertex_to_facet(4); ib.add_vertex_to_facet(5); diff --git a/Mesh_2/test/Mesh_2/test_meshing.cpp b/Mesh_2/test/Mesh_2/test_meshing.cpp index ab132707fb92..2654f78aca9b 100644 --- a/Mesh_2/test/Mesh_2/test_meshing.cpp +++ b/Mesh_2/test/Mesh_2/test_meshing.cpp @@ -115,7 +115,7 @@ struct Tester2 { std::cerr << "Triangulation restored.\n"; std::cerr << "Number of vertices: " << cdt.number_of_vertices() << "\n\n"; - std::cerr << "2/ Comparaison between refine_Delaunay_mesh_2() and other" + std::cerr << "2/ Comparison between refine_Delaunay_mesh_2() and other" << " possibilities:\n\n"; std::cerr << "Meshing the triangulation with size 0.1, with " diff --git a/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h b/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h index 9e0e045350b9..2c0539b9be09 100644 --- a/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h +++ b/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h @@ -816,7 +816,7 @@ operator()(Visitor visitor) #endif running_time_.stop(); - helper_.reset_cache();//in case we re-use caches in another operation + helper_.reset_cache();//in case we reuse caches in another operation // after this perturbation #ifdef CGAL_MESH_3_PERTURBER_VERBOSE diff --git a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h index e4f19eaa9564..67053066e0bd 100644 --- a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h +++ b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h @@ -1198,7 +1198,7 @@ expand_prestar(const Cell_handle& cell_to_add, if(! tr_.is_infinite(current_mirror_cell)) { - // if current_mirror_cell is finite, we can re-use the value + // if current_mirror_cell is finite, we can reuse the value // 'new_power_distance_to_power_sphere' // Ensure that 'new_power_distance_to_power_sphere' has been initialized @@ -1287,7 +1287,7 @@ get_best_weight(const Vertex_handle& v, bool *could_lock_zone) const && pre_star.front()->first < (sq_delta_ * sq_d_v) && ! c3t3_.is_in_complex(pre_star.front()->second) ) { - // Store critial radius (pre_star will be modified in expand_prestar) + // Store critical radius (pre_star will be modified in expand_prestar) FT power_distance_to_power_sphere = pre_star.front()->first; // expand prestar (insert opposite_cell facets in pre_star) diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt b/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt index 6c6567f67e95..ca7ec155a42e 100644 --- a/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt +++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt @@ -611,7 +611,7 @@ edges of which are line segments and circular arcs of radius \f$ r\f$. The inset can be computed using the convolution method traversing the polygon in a clockwise order (as oppose to the -counterclockwise order applied in the case of ofsetting a polygon). +counterclockwise order applied in the case of offsetting a polygon). As with the (outer) offset functions, the Minkowski-sum package contains two functions for insetting a simple polygon, namely, `approximated_inset_2(P, r, eps, oi)` and `inset_polygon_2(P, r, traits, oi)`. @@ -647,7 +647,7 @@ The package also provides overloaded versions of the functions and \link offset_polygon_2() `offset_polygon_2(P, r, traits)`\endlink that accept a polygon with holes -\f$ P\f$ and compute its offset. This ofset is obtain by computing the +\f$ P\f$ and compute its offset. This offset is obtain by computing the outer offset of the outer boundary of \f$ P\f$'s, and computing the inner offsets of the holes of \f$ P\f$. The former polygon defines the output boundary of \f$ P \oplus B_r\f$, and the latter define the holes within diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_collision_detector_2.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_collision_detector_2.h index 4a4d8ab4757e..28e51503f8aa 100644 --- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_collision_detector_2.h +++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_collision_detector_2.h @@ -86,7 +86,7 @@ class AABB_collision_detector_2 *m_p.holes_begin()->vertices_begin() + Vector_2(ORIGIN, t); // Use bounded_side_2() instead of on_bounded_side() because the latter - // checks vor simplicity every time. + // checks for simplicity every time. bool in_mp(true); if (! m_p.outer_boundary().is_empty()) in_mp = diff --git a/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h b/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h index 28a13dd4dcdb..f862c3c494a5 100644 --- a/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h +++ b/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h @@ -283,7 +283,7 @@ class Polygon_vertical_decomposition_2 { CGAL::decompose(arr, std::back_inserter(vd_list)); // Go over the vertices (given in ascending lexicographical xy-order), - // and add segments to the feautres below and above it. + // and add segments to the features below and above it. typename Vert_decomp_list::iterator it, prev = vd_list.end(); for (it = vd_list.begin(); it != vd_list.end(); ++it) { // If the feature above the previous vertex is not the current vertex, diff --git a/Nef_3/doc/Nef_3/CGAL/Nef_polyhedron_3.h b/Nef_3/doc/Nef_3/CGAL/Nef_polyhedron_3.h index ff3fd4c57e8a..06f67260279b 100644 --- a/Nef_3/doc/Nef_3/CGAL/Nef_polyhedron_3.h +++ b/Nef_3/doc/Nef_3/CGAL/Nef_polyhedron_3.h @@ -1057,12 +1057,12 @@ template< class Nef_polyhedronTraits_3, typedef unspecified_type SHalfedge_around_facet_const_circulator; /*! - non-mutable iterator over the cylces of a sface. + non-mutable iterator over the cycles of a sface. */ typedef unspecified_type SFace_cycle_const_iterator; /*! - non-mutable iterator over the cylces of a halffacet. + non-mutable iterator over the cycles of a halffacet. */ typedef unspecified_type Halffacet_cycle_const_iterator; diff --git a/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h b/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h index 47e85c817ae3..11b1b866f633 100644 --- a/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h +++ b/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h @@ -369,7 +369,7 @@ class SNC_const_decorator { continue; } - // We have to comapare the two scalar products sk0 and sk1. Therefore + // We have to compare the two scalar products sk0 and sk1. Therefore // we have to normalize the input vectors vec0 and vec1, which means // that we have to divide them by their lengths len0 and len1. // To cicumvent irrational numbers, we square the whole inequality. diff --git a/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h b/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h index 96dfc3d41f5c..8be2fe077b5e 100644 --- a/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h +++ b/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h @@ -325,14 +325,14 @@ supporting `s`. const Sphere_circle& sphere_circle() ; /*! -returns the sperical +returns the spherical segment oriented from `target()` to `source()` with the same point set as `s`. */ Sphere_segment opposite() ; /*! -returns the sperical +returns the spherical segment oriented from `target()` to `source()` with the point set completing `s` to a full circle. */ diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h b/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h index 24496cae9878..f611afe7b02c 100644 --- a/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h +++ b/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h @@ -1020,7 +1020,7 @@ check_sphere(const Seg_list& L, bool compute_halfsphere[3][2]) const { // int l = it->compare_length_to_halfcircle(); CGAL_NEF_TRACEN("source " << it->source()); CGAL_NEF_TRACEN("target " << it->target()); - CGAL_NEF_TRACEN("cicle " << it->sphere_circle()); + CGAL_NEF_TRACEN("circle " << it->sphere_circle()); CGAL_NEF_TRACEN("is long " << it->is_long()); if(it->is_short()) continue; diff --git a/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h b/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h index a526ec5085d5..241cc65ae43d 100644 --- a/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h +++ b/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h @@ -150,13 +150,13 @@ const Sphere_circle& sphere_circle() const { return this->ptr()->c_; } /*{\Mop the great circle supporting |\Mvar|.}*/ Sphere_segment opposite() const -/*{\Mop returns the sperical segment oriented from |target()| +/*{\Mop returns the spherical segment oriented from |target()| to |source()| with the same point set as |\Mvar|. }*/ { return Sphere_segment( target(),source(),sphere_circle().opposite()); } Sphere_segment complement() const -/*{\Mop returns the sperical segment oriented from |target()| +/*{\Mop returns the spherical segment oriented from |target()| to |source()| with the point set completing |\Mvar| to a full circle. }*/ { return Sphere_segment(target(),source(),sphere_circle()); } diff --git a/Number_types/include/CGAL/Mpzf.h b/Number_types/include/CGAL/Mpzf.h index 44bb8fd92464..2820b3a2b929 100644 --- a/Number_types/include/CGAL/Mpzf.h +++ b/Number_types/include/CGAL/Mpzf.h @@ -168,7 +168,7 @@ template struct pool3 { T data_ = 0; ~cleaner(){ // Deallocate everything. As an alternative, we could store it in a - // global location, for re-use by a later thread. + // global location, for reuse by a later thread. while (!empty()) delete[] (pop() - (extra + 1)); } diff --git a/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h b/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h index a4daeef3828f..1f884370c744 100644 --- a/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h +++ b/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h @@ -43,7 +43,7 @@ namespace Intern{ * They are decomposable iff their coefficient type is. * The denominator \e d of an extension \e ext is a low common multiple * (see \c CGAL::Fraction_traits::Common_factor for details) of the - * denominators of its coefficients. The numerator is the extenion + * denominators of its coefficients. The numerator is the extension * \e d*ext with a fraction-free coefficient type. * * This works for nested Sqrt_extensions, too. diff --git a/Number_types/test/Number_types/CORE_Expr.cpp b/Number_types/test/Number_types/CORE_Expr.cpp index 6fd99d12e41a..1ab7ca305e14 100644 --- a/Number_types/test/Number_types/CORE_Expr.cpp +++ b/Number_types/test/Number_types/CORE_Expr.cpp @@ -550,7 +550,7 @@ void algebraic_real_test() } //simplify { - // just a synatx check + // just a syntax check ALGNUM(P_s2510,1,2).simplify(); } } diff --git a/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp b/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp index d66243f35a5a..2d86e6a59d0f 100644 --- a/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp +++ b/Periodic_3_mesh_3/examples/Periodic_3_mesh_3/mesh_periodic_polyhedral_domain.cpp @@ -25,7 +25,7 @@ namespace CGAL { // This is a wrapper to convert a polyhedral surface to a periodic polyhedral domain // over a user-provided canonical domain. // -// It is the user's responsability to ensure that the polyhedral domain is actually periodic +// It is the user's responsibility to ensure that the polyhedral domain is actually periodic // over the canonical domain, i.e. there is periodic continuity at the boundaries // of the canonical domain. template diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h index 1d11a29adc51..788367ba7073 100644 --- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h +++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h @@ -131,7 +131,7 @@ insert_generic_dummy_points() return goff; }; - // This should be prefered from building points from the lattice offset + // This should be preferred from building points from the lattice offset // because the grid offset (by construction) aligns with the canonical domain, // and there is thus fewer numerical errors. auto construct_point_from_grid_offset = [&](const Offset& goff) -> Point_3 diff --git a/Point_set_2/include/CGAL/range_search_delaunay_2.h b/Point_set_2/include/CGAL/range_search_delaunay_2.h index c6b81efcd413..04a342964327 100644 --- a/Point_set_2/include/CGAL/range_search_delaunay_2.h +++ b/Point_set_2/include/CGAL/range_search_delaunay_2.h @@ -202,7 +202,7 @@ OutputIterator range_search(Dt& delau, // Note that the function only works correctly with exact constructions // because it computes the circumcenter of the points a, b, and c // and then performs a range query with this circle. -// When vertices of the trinagulation are on the circle the outcome +// When vertices of the triangulation are on the circle the outcome // is not deterministic. // A solution would be to not construct a circle, but to use the // function CGAL::side_of_bounded_circle diff --git a/Point_set_processing_3/include/CGAL/scanline_orient_normals.h b/Point_set_processing_3/include/CGAL/scanline_orient_normals.h index 6869db72e977..f0bbdc4f5c63 100644 --- a/Point_set_processing_3/include/CGAL/scanline_orient_normals.h +++ b/Point_set_processing_3/include/CGAL/scanline_orient_normals.h @@ -373,10 +373,10 @@ void orient_scanline (Iterator begin, Iterator end, iterating on `points`: - if the named parameter `scanline_id_map` is provided, the range - is cut everytime the id changes. + is cut every time the id changes. - if no scanline ID map is provided, a fallback method simply cuts - the range everytime 3 consecutive points form an acute angle on + the range every time 3 consecutive points form an acute angle on the projected XY-plane. This fallback method gives suboptimal results. diff --git a/Poisson_surface_reconstruction_3/include/CGAL/Surface_mesher/Poisson_implicit_surface_oracle_3.h b/Poisson_surface_reconstruction_3/include/CGAL/Surface_mesher/Poisson_implicit_surface_oracle_3.h index e43214ce6633..22dd536c08d4 100644 --- a/Poisson_surface_reconstruction_3/include/CGAL/Surface_mesher/Poisson_implicit_surface_oracle_3.h +++ b/Poisson_surface_reconstruction_3/include/CGAL/Surface_mesher/Poisson_implicit_surface_oracle_3.h @@ -329,7 +329,7 @@ namespace CGAL { #ifdef CGAL_SURFACE_MESHER_DEBUG_CLIPPED_SEGMENT std::cerr << "=" << debug_point(surface, mid) << "\n"; #endif - // the following function conditionnally call + // the following function conditionally call // mid.set_on_surface(...) if mid has such a function. set_on_surface(mid, surface_identifiers_generator(transform_functor(value_at_p1), diff --git a/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/fast.cpp b/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/fast.cpp index 20cf6834d21a..a9b9be6b10e4 100644 --- a/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/fast.cpp +++ b/Polygon_mesh_processing/benchmark/Polygon_mesh_processing/fast.cpp @@ -20,7 +20,7 @@ // `fast` takes an off file and an offset as arguments // If called additionally with 3 more vertex indices it performs the envelope test with the triangle -// Otherwise it tests for all vertex triples forming a non-degenerate trianges +// Otherwise it tests for all vertex triples forming a non-degenerate triangles // and writes the triple in the file inside.txt or outside.txt int main(int argc, char* argv[]) diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp index 53d70af603ff..a52d183f33e1 100644 --- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp +++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp @@ -11,7 +11,7 @@ typedef CGAL::Surface_mesh Mesh; namespace PMP = CGAL::Polygon_mesh_processing; -// a sizing fied that is increasing the size of edge along the y-axis +// a sizing field that is increasing the size of edge along the y-axis // starting at a minimum size at y-max and ending at a maximum size at // y-min, with a linear interpolation of sizes in between the two extreme // sizing values diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/angle_and_area_smoothing.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/angle_and_area_smoothing.h index beda665855a6..c2a14aabf2a2 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/angle_and_area_smoothing.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/angle_and_area_smoothing.h @@ -337,7 +337,7 @@ void angle_and_area_smoothing(const FaceRange& faces, * * Optionally, the points are reprojected after each iteration. * -* See the overload which takes a face range as additonal parameter for a comprehensive description +* See the overload which takes a face range as additional parameter for a comprehensive description * of the parameters. */ template diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/extrude.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/extrude.h index c2882efd5f47..5a8b3031d88f 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/extrude.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/extrude.h @@ -145,12 +145,12 @@ struct Identity_functor * * \cgalNamedParamsBegin * \cgalParamNBegin{vertex_point_map} - * \cgalParamDescription{a property map associating points to the vertices of `ouput`} + * \cgalParamDescription{a property map associating points to the vertices of `output`} * \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits::%vertex_descriptor` * as key type and `%Point_3` as value type} * \cgalParamDefault{`boost::get(CGAL::vertex_point, output)`} * \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t` - * should be available for the vertices of `ouput`.} + * should be available for the vertices of `output`.} * \cgalParamNEnd * \cgalNamedParamsEnd */ diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h index 66cfa7bc344a..c63c3e1a8f8d 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_impl.h @@ -1278,7 +1278,7 @@ class Intersection_of_triangle_meshes it_seg13->second.get_segments(f1f3_segments); /// TODO AUTOREF_TAG shall we ignore tangency points? - /// with the current code, Node_id_set::size()==1 is ignored as we only drop semgents + /// with the current code, Node_id_set::size()==1 is ignored as we only drop segments /// Actually it might be that it is not a tangency point if the third segment was considered! /// so not handling it is a bug diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/mesh_smoothing_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/mesh_smoothing_impl.h index d43041251cb5..5f906270511e 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/mesh_smoothing_impl.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/mesh_smoothing_impl.h @@ -366,7 +366,7 @@ class Area_smoother s_av(s_av) { } - // next two functions are just for convencience, the only thing ceres cares about is the operator() + // next two functions are just for convenience, the only thing ceres cares about is the operator() template FT area(const T x, const T y, const T z) const { diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h index 13cad81b410b..e30043961d24 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h @@ -1000,7 +1000,7 @@ class Interpolated_corrected_curvatures_computer * * computes the interpolated corrected curvatures across the mesh `pmesh`. * By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user -* can choose which quantites to compute. +* can choose which quantities to compute. * * \note This function depends on the \eigen 3.1 (or later) library. * @@ -1090,7 +1090,7 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh, * \ingroup PMP_corrected_curvatures_grp * computes the interpolated corrected curvatures at a vertex `v`. * By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user -* can choose which quantites to compute. +* can choose which quantities to compute. * * \note This function depends on the \eigen 3.1 (or later) library. * diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh_planar_patches.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh_planar_patches.h index 71e49fcbffa0..71cba41b6cd2 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh_planar_patches.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh_planar_patches.h @@ -696,7 +696,7 @@ bool decimate_impl(const TriangleMesh& tm, { if (csts.size() > 3 && do_not_triangulate_faces) { - // TODO this is not optimal at all since we already have the set of contraints, + // TODO this is not optimal at all since we already have the set of constraints, // we could work on the graph on constraint and recover only the orientation // of the edge. To be done if someone find it too slow. std::vector hborders; diff --git a/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h b/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h index 51656561bde7..e43ebd59cc28 100644 --- a/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h +++ b/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h @@ -1749,7 +1749,7 @@ struct Polyhedral_envelope { if (tti != CUT_FACE){ continue; } - // now we know that there exists an intesection point + // now we know that there exists an intersection point std::optional op = intersection_point_for_polyhedral_envelope(eline, halfspace[filtered_intersection[queue[i]]][intersect_face[queue[i]][j]].eplane); diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp index a2843ecae8ca..bb9a6d550bf9 100644 --- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp +++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp @@ -55,7 +55,7 @@ void test_polygon_soup(std::string fname, bool expected) { Polyhedron p; - // just to test the named paramers + // just to test the named parameters typedef std::pair Point_with_Boolean; std::vector points_with_pairs; for(const Point& pt : points) diff --git a/Polyhedron/examples/Polyhedron/polyhedron_self_intersection.cpp b/Polyhedron/examples/Polyhedron/polyhedron_self_intersection.cpp index 7f2760097137..b5cfa8963fc8 100644 --- a/Polyhedron/examples/Polyhedron/polyhedron_self_intersection.cpp +++ b/Polyhedron/examples/Polyhedron/polyhedron_self_intersection.cpp @@ -65,7 +65,7 @@ struct Intersect_facets { if ( v != Halfedge_const_handle()) { // found shared vertex: assert( h->vertex() == v->vertex()); - // geomtric check if the opposite segments intersect the triangles + // geometric check if the opposite segments intersect the triangles Triangle t1( h->vertex()->point(), h->next()->vertex()->point(), h->next()->next()->vertex()->point()); diff --git a/Polyhedron/include/CGAL/Polyhedron_incremental_builder_3.h b/Polyhedron/include/CGAL/Polyhedron_incremental_builder_3.h index 6c5c3d711537..bbb2977db061 100644 --- a/Polyhedron/include/CGAL/Polyhedron_incremental_builder_3.h +++ b/Polyhedron/include/CGAL/Polyhedron_incremental_builder_3.h @@ -73,7 +73,7 @@ class Polyhedron_incremental_builder_3 { bool first_vertex; bool last_vertex; - CGAL_assertion_code( int check_protocoll;) // use to check protocoll. + CGAL_assertion_code( int check_protocoll;) // use to check_protocoll. // states for checking: 0 = created, 1 = constructing, 2 = make face. // Implement the vertex_to_edge_map either with an array or diff --git a/Polynomial/include/CGAL/Polynomial/modular_gcd_utcf_algorithm_M.h b/Polynomial/include/CGAL/Polynomial/modular_gcd_utcf_algorithm_M.h index c2b8cfd66341..e88bbb620d70 100644 --- a/Polynomial/include/CGAL/Polynomial/modular_gcd_utcf_algorithm_M.h +++ b/Polynomial/include/CGAL/Polynomial/modular_gcd_utcf_algorithm_M.h @@ -59,7 +59,7 @@ Polynomial modular_gcd_utcf_algorithm_M( #endif typedef Polynomial Poly; - // will paly the role of content + // will play the role of content typedef typename CGAL::Scalar_factor_traits::Scalar Scalar; typedef typename CGAL::Modular_traits::Residue_type MPoly; diff --git a/Polynomial/include/CGAL/Polynomial/polynomial_gcd_implementations.h b/Polynomial/include/CGAL/Polynomial/polynomial_gcd_implementations.h index a23b110d7f9f..1e897ccf890d 100644 --- a/Polynomial/include/CGAL/Polynomial/polynomial_gcd_implementations.h +++ b/Polynomial/include/CGAL/Polynomial/polynomial_gcd_implementations.h @@ -168,7 +168,7 @@ Polynomial gcd_utcf_Integral_domain( Polynomial p1, Polynomial p2){ Polynomial q, r; - // TODO measure performance of both methodes with respect to + // TODO measure performance of both methods with respect to // univariat polynomials on Integeres // univariat polynomials on Sqrt_extension // multivariat polynomials diff --git a/Polynomial/include/CGAL/Polynomial/subresultants.h b/Polynomial/include/CGAL/Polynomial/subresultants.h index e6f4eb40fcd2..042f8ba9cd0e 100644 --- a/Polynomial/include/CGAL/Polynomial/subresultants.h +++ b/Polynomial/include/CGAL/Polynomial/subresultants.h @@ -130,7 +130,7 @@ namespace CGAL { * This is an implementation of Ducos' algorithm. It improves on the * classical methods for subresultant computation by reducing the * swell-up of intermediate results. For all details, see - * L.Ducos: Optimazations of the Subresultant algorithm. Journal of Pure + * L.Ducos: Optimizations of the Subresultant algorithm. Journal of Pure * and Applied Algebra 145 (2000) 149--163 */ template inline diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h index dfbf7cf31357..c29af9b79dd0 100644 --- a/Polynomial/include/CGAL/Polynomial_traits_d.h +++ b/Polynomial/include/CGAL/Polynomial_traits_d.h @@ -999,7 +999,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >, // Sign_at, Sign_at_homogeneous, Compare // define XXX_ even though ICoeff may not be Real_embeddable - // select propoer XXX among XXX_ or Null_functor using ::std::conditional_t + // select proper XXX among XXX_ or Null_functor using ::std::conditional_t private: struct Sign_at_ { private: diff --git a/Polytope_distance_d/include/CGAL/Width_3.h b/Polytope_distance_d/include/CGAL/Width_3.h index 8ebc1cd0cdc4..293d65635f44 100644 --- a/Polytope_distance_d/include/CGAL/Width_3.h +++ b/Polytope_distance_d/include/CGAL/Width_3.h @@ -704,7 +704,7 @@ class Width_3 { RT maxdist=0; RT hompart=1; //Try every point to be an/the antipodal vertex of the facet f. Take the - //one with the bigest distance from E1 + //one with the biggest distance from E1 DEBUGENDL(INITIAL_VF_PAIR,"Plane E1:",f->plane()); while (vtxit != P.vertices_end() ) { RT pix, piy, piz, pih; @@ -871,7 +871,7 @@ class Width_3 { <<"ASSERTION OK."); if ( a*nx+b*ny+c*nz+d*nh >= 0 ) { //Could be a violation. Now check if v and n lie on the - //same plane. If so no violation, othervise we can break + //same plane. If so no violation, otherwise we can break if (a*nx+b*ny+c*nz+d*nh == 0 ) { DEBUGMSG(CHECK_ABOUT_VF_PAIRS,"Additional Antipodal Vertex " <<"found. Expanding "<<"set of witnesses."); diff --git a/Property_map/doc/Property_map/Property_map.txt b/Property_map/doc/Property_map/Property_map.txt index d2ecf66d1df8..1c044a148a84 100644 --- a/Property_map/doc/Property_map/Property_map.txt +++ b/Property_map/doc/Property_map/Property_map.txt @@ -12,7 +12,7 @@ namespace CGAL { \section Property_mapA A Short Introduction to the Boost Property Maps Library -The Boost Property Map Library consists mainly of interface specifications in the form of concepts. These interface specifications are intended for use by implementors of generic libraries in communicating requirements on template parameters to their users. In particular, the Boost Property Map concepts define a general purpose interface for mapping key objects to corresponding value objects, thereby hiding the details of how the mapping is implemented from algorithms. The implementation of types fulfilling the property map interface is up to the client of the algorithm to provide. +The Boost Property Map Library consists mainly of interface specifications in the form of concepts. These interface specifications are intended for use by implementers of generic libraries in communicating requirements on template parameters to their users. In particular, the Boost Property Map concepts define a general purpose interface for mapping key objects to corresponding value objects, thereby hiding the details of how the mapping is implemented from algorithms. The implementation of types fulfilling the property map interface is up to the client of the algorithm to provide. The Boost Property Map Library also contains a few adaptors that convert commonly used data-structures that implement a mapping operation, such as builtin arrays (pointers), iterators, and std::map, to have the property map interface. diff --git a/Property_map/include/CGAL/Property_container.h b/Property_map/include/CGAL/Property_container.h index 739f652b3184..4aa3fe155770 100644 --- a/Property_map/include/CGAL/Property_container.h +++ b/Property_map/include/CGAL/Property_container.h @@ -109,7 +109,7 @@ class Property_array : public Property_array_base { CGAL_precondition(m_active_indices.size() == m_data.size()); } -// deactived as MSVC 2017 as an issue with that but it is not currently used. +// deactivated as MSVC 2017 has an issue with that but it is not currently used. #if 0 virtual void move(Property_array_base&& other_base) override { auto&& other = static_cast&&>(other_base); diff --git a/Property_map/test/Property_map/test_Property_container.cpp b/Property_map/test/Property_map/test_Property_container.cpp index 1efe25f4001a..eb0099ed8c1c 100644 --- a/Property_map/test/Property_map/test_Property_container.cpp +++ b/Property_map/test/Property_map/test_Property_container.cpp @@ -18,7 +18,7 @@ void test_property_creation() { static_assert(std::is_same_v>>); assert(properties.num_properties() == 2); - // get() should retreive the same arrays + // get() should retrieve the same arrays assert(integers.get() == properties.get_property("integer")); assert(floats.get() == properties.get_property("float")); diff --git a/QP_solver/include/CGAL/QP_functions.h b/QP_solver/include/CGAL/QP_functions.h index 37c90936eca2..89e650180ac6 100644 --- a/QP_solver/include/CGAL/QP_functions.h +++ b/QP_solver/include/CGAL/QP_functions.h @@ -30,7 +30,7 @@ namespace QP_functions_detail { // p is treated as LinearProgram / QuadraticProgram // Is_nonnegative == Tag_true / Tag_false // p is treated as Nonnegative / Arbitrary - // the dmatrix parameter specificies whether the quadratic matrix (if any) + // the dmatrix parameter specifies whether the quadratic matrix (if any) // is written in DMATRIX format (no multiplication by two, good for // cross-checking output, or in QMATRIX format (good for using other // solvers like CPLEX) @@ -83,7 +83,7 @@ namespace QP_functions_detail { bool is_in_equational_form (const R& r); // internal routine: - // test whether the row vectors of A that correpsond to equations + // test whether the row vectors of A that correspond to equations // are linearly independent; this is done using type ET. The value // type of LinearInequalitySystem must be convertible to ET template diff --git a/QP_solver/include/CGAL/QP_solver/QP_functions_impl.h b/QP_solver/include/CGAL/QP_solver/QP_functions_impl.h index 37496f161367..83d409a175e9 100644 --- a/QP_solver/include/CGAL/QP_solver/QP_functions_impl.h +++ b/QP_solver/include/CGAL/QP_solver/QP_functions_impl.h @@ -36,7 +36,7 @@ namespace QP_functions_detail { return true; } - // test whether the row vectors of A that correpsond to equations + // test whether the row vectors of A that correspond to equations // are linearly independent; this is done using type ET. The value // type of LinearInequalitySystem must be convertible to ET template diff --git a/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h b/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h index 262e20f1ba70..d0eefd3454c5 100644 --- a/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h +++ b/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h @@ -1053,7 +1053,7 @@ ratio_test_2( Tag_false) // optimal BEFORE a variable drops to zero. As delta = mu_j - mu_j(t_1), // the latter is precisely the case if delta_min >= -mu_j(t_1). // - // (Note: please forget the crap identitiy between (2.11) and (2.12); the + // (Note: please forget the crap identity between (2.11) and (2.12); the // notation is misleading.) // // Now to the nonstandard-form case. diff --git a/STL_Extension/include/CGAL/Handle_with_policy.h b/STL_Extension/include/CGAL/Handle_with_policy.h index 528bf8061d10..7127e36fd962 100644 --- a/STL_Extension/include/CGAL/Handle_with_policy.h +++ b/STL_Extension/include/CGAL/Handle_with_policy.h @@ -597,7 +597,7 @@ class Handle_policy_union_and_reset { typedef Reference_counted_hierarchy_with_union Type; }; - // abbreviation to re-use its implementation below. + // abbreviation to reuse its implementation below. typedef Handle_policy_union U; /*! \brief unifies the representations of the two handles \a h and \a g. diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/boost/array_binary_tree.hpp b/STL_Extension/include/CGAL/STL_Extension/internal/boost/array_binary_tree.hpp index 3e1fa9631765..addbac79ccd6 100644 --- a/STL_Extension/include/CGAL/STL_Extension/internal/boost/array_binary_tree.hpp +++ b/STL_Extension/include/CGAL/STL_Extension/internal/boost/array_binary_tree.hpp @@ -30,7 +30,7 @@ namespace CGAL { namespace internal { namespace boost_ { /* - * Note: array_binary_tree is a completey balanced binary tree. + * Note: array_binary_tree is a completely balanced binary tree. */ #if !defined BOOST_NO_STD_ITERATOR_TRAITS template diff --git a/STL_Extension/include/CGAL/algorithm.h b/STL_Extension/include/CGAL/algorithm.h index 34ca7c58cf50..8cabe0a3f4b7 100644 --- a/STL_Extension/include/CGAL/algorithm.h +++ b/STL_Extension/include/CGAL/algorithm.h @@ -263,7 +263,7 @@ lexicographical_compare_three_valued( InputIterator1 first1, InputIterator1 last The iterator range \c [first,beyond) is written to \c os (obeying CGAL I/O modes). Each element is bracketed by \c pre and \c post (default: empty string). Adjacent values are - spearated by \c sep (default: ", ", i.e. comma space). + separated by \c sep (default: ", ", i.e. comma space). The stream \c os is returned in its new state after output. Example: diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h index d0f393c08217..f2aa49221829 100644 --- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h +++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h @@ -123,7 +123,7 @@ class Alpha_shape_mesher // The shape must be a pointer, because the alpha of a Fixed_alpha_shape_3 // can only be set at construction and its assignment operator is private. // We want to be able to set the alpha after constructing the scale-space - // reconstructer object. + // reconstructor object. Shape* _shape; // The surface. If the surface is collected per shell, the triples of the diff --git a/Scripts/developer_scripts/autotest_cgal b/Scripts/developer_scripts/autotest_cgal index c984ac9ae231..8d0f0f3b8f84 100755 --- a/Scripts/developer_scripts/autotest_cgal +++ b/Scripts/developer_scripts/autotest_cgal @@ -9,7 +9,7 @@ # * or alternatively curl # # Furthermore you have to edit .autocgalrc in order to -# cutomize it for your environment. +# customize it for your environment. # In particular you have to change the BUILHOSTS # variable to contain the names of your hosts and # set the COMPILERS_ variables to the diff --git a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp index 09791c10c363..101087519e7a 100644 --- a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp +++ b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp @@ -15,7 +15,7 @@ #include #define SDG_DRAW_DEBUG // debug log -#define SDG_DRAW_DUMP_FILES // print input / ouput +#define SDG_DRAW_DUMP_FILES // print input / output // #define SINGLE_INPUT_FILE // if not defined, each segment of the input has its own file #ifdef SDG_DRAW_DUMP_FILES_PP // also print parabolas diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h index 00c2130c50a6..d09313c5d6b0 100644 --- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h +++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h @@ -2549,7 +2549,7 @@ arrangement_type(const Site_2& p, const Site_2& q) const Arrangement_type res = geom_traits().arrangement_type_2_object()(p, q); - // The valeus that have to be treated are the following: + // The values that have to be treated are the following: // DISJOINT, TOUCH_1, TOUCH_2, CROSSING, IDENTICAL, INTERIOR, // TOUCH_11_INTERIOR_1, TOUCH_12_INTERIOR_1, TOUCH_21_INTERIOR_1 and // TOUCH_22_INTERIOR_1. diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h index 9b7a93556219..5b6b43ad1611 100644 --- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h +++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Vertex_conflict_C2.h @@ -147,7 +147,7 @@ class Vertex_conflict_C2 bool q_exact = q.is_input(); bool t_exact = t.is_input(); bool filtered = false; - // the following if-statement does the gometric filtering... + // the following if-statement does the geometric filtering... // maybe it is not so important since this will only be // activated if a lot of intersection points appear on the // convex hull @@ -239,7 +239,7 @@ class Vertex_conflict_C2 bool q_exact = q.is_input(); bool t_exact = t.is_input(); bool filtered = false; - // the following if-statement does the gometric filtering... + // the following if-statement does the geometric filtering... // maybe it is not so important since this will only be // activated if a lot of intersection points appear on the // convex hull diff --git a/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Vertex_conflict_C2.h b/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Vertex_conflict_C2.h index 229e30ffc9c5..c78bc09543c2 100644 --- a/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Vertex_conflict_C2.h +++ b/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Vertex_conflict_C2.h @@ -184,7 +184,7 @@ class Vertex_conflict_C2 bool q_exact = q.is_input(); bool t_exact = t.is_input(); bool filtered = false; - // the following if-statement does the gometric filtering... + // the following if-statement does the geometric filtering... // maybe it is not so important since this will only be // activated if a lot of intersection points appear on the // convex hull @@ -284,7 +284,7 @@ class Vertex_conflict_C2 bool q_exact = q.is_input(); bool t_exact = t.is_input(); bool filtered = false; - // the following if-statement does the gometric filtering... + // the following if-statement does the geometric filtering... // maybe it is not so important since this will only be // activated if a lot of intersection points appear on the // convex hull diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h index 61e157c8745a..03074231c09f 100644 --- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h +++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h @@ -308,7 +308,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. diff --git a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h index a070f1522d30..d626c6706017 100644 --- a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h +++ b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h @@ -68,7 +68,7 @@ class Point_with_hot_pixel_history : public Traits::Point_2 { ////////////////////// //Search_traits_kd_tree_2 // -//(Search traits modified to be used by the Spacial Searching kd_trees for Snap rounding) +//(Search traits modified to be used by the Spatial Searching kd_trees for Snap rounding) ////////////////////// template < class Traits_, class Point_ = typename Traits_::Point_2 > diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h b/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h index 7261727d5ae2..4b370bdba1fa 100644 --- a/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h +++ b/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h @@ -209,7 +209,7 @@ OutputIterator search(OutputIterator it, FuzzyQueryItem q) const; Returns a const iterator to the first point in the tree. \note Starting with \cgal 4.6, the order of the points in the iterator range `[begin() , end())` is not the order of insertion of the points into the tree. -This was not guaranteed before but might have beeen observed and exploited. +This was not guaranteed before but might have been observed and exploited. */ iterator begin() const; diff --git a/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query_projection.cpp b/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query_projection.cpp index c50c2853a0df..106b83557b98 100644 --- a/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query_projection.cpp +++ b/Spatial_searching/examples/Spatial_searching/iso_rectangle_2_query_projection.cpp @@ -52,7 +52,7 @@ int main() Point_2 q(0.7, 0.7); // Searching an exact range - // using default value 0.0 for epsilon fuzziness paramater + // using default value 0.0 for epsilon fuzziness parameter Fuzzy_iso_box exact_range(p,q); tree.search( std::back_inserter( result ), exact_range); std::cout << "The points in the box [0.2, 0.7]^2 are: " << std::endl; @@ -62,7 +62,7 @@ int main() result.clear(); // Searching a fuzzy range - // using value 0.1 for fuzziness paramater + // using value 0.1 for fuzziness parameter Fuzzy_iso_box approximate_range(p, q, 0.1); tree.search(std::back_inserter( result ), approximate_range); std::cout << "The points in the fuzzy box [[0.1, 0.3], [0.6, 0.8]]^2 are: " << std::endl; diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/extrude_skeleton.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/extrude_skeleton.h index 6fcb059ae2d5..af6dd682f58a 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/extrude_skeleton.h +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/extrude_skeleton.h @@ -13,7 +13,7 @@ namespace CGAL { * `maximum_height()` named parameter. * * The result is a closed, 2-manifold surface triangle mesh. Note that this mesh can have non-local -* self-intersections if a maximal height is provided due to possible (geometric) non-manifold occurences. +* self-intersections if a maximal height is provided due to possible (geometric) non-manifold occurrences. * * @tparam PolygonWithHoles must be a model of `SequenceContainer` with value type `InK::Point_2` (e.g. `Polygon_2`) or a model of `GeneralPolygonWithHoles_2` (e.g. `Polygon_with_holes_2`). diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt b/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt index c771bf8929e5..9686bdf2e974 100644 --- a/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt +++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt @@ -175,7 +175,7 @@ for each boundary that does not contain the defining contour edge of its inciden \cgalFigureCaptionBegin{SLSArtificial} A polygon with four holes (black) and its straight skeleton (red). -Three artifical bisectors (green) are added in a post-processing step to recover the simply-connected +Three artificial bisectors (green) are added in a post-processing step to recover the simply-connected property for the straight skeleton face (gray) of the rightmost vertical contour edge. \cgalFigureCaptionEnd diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h index 5470ad13717d..0c0a87466cae 100644 --- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h +++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h @@ -2037,7 +2037,7 @@ bool Straight_skeleton_builder_2::MergeCoincidentNodes() // For weighted skeletons of polygons with holes, one can create non-simply-connected skeleton faces. // This is a problem both because it is not a valid HDS, and because we walk skeleton face borders -// in polygon offseting. We add so-called artificial nodes and bisectors to ensure that faces +// in polygon offsetting. We add so-called artificial nodes and bisectors to ensure that faces // are simply-connected by shooting rays from the topmost vertex of the bisectors of the skeleton // of the hole(s). template @@ -2317,7 +2317,7 @@ extreme_h / \ extreme_h / \ // This is not a valid triedge because split_h is not a contour halfedge, but we need // to know which skeleton bisector the line orthogonal to contour_h interscets. - // The pair of identical contour halfedges at e0 and e1 is the marker for artifical vertices + // The pair of identical contour halfedges at e0 and e1 is the marker for artificial vertices SetVertexTriedge(new_v, artificial_event->triedge()); SetTrisegment(new_v, artificial_event->trisegment()); diff --git a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h index 9d04a209e264..2fa5d01ce061 100644 --- a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h +++ b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h @@ -567,7 +567,7 @@ compute_artifical_isec_timeC2 ( Trisegment_2_ptr< Trisegment_2(FT(0),FT(0))) ; // does not exist - // Compute the intersection point and evalute the time from the line equation of the contour edge + // Compute the intersection point and evaluate the time from the line equation of the contour edge auto inter_res = K().intersect_2_object()(ray, opp_seg); FT t; diff --git a/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h b/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h index bb8929a3da96..e4d7ef2722ad 100644 --- a/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h +++ b/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h @@ -886,7 +886,7 @@ void convert_angles(AngleRange& angles) CGAL_precondition(0 < angle && angle < 180); // @todo should this be an epsilon around 90°? As theta goes to 90°, tan(theta) goes to infinity - // and thus we could get numerical issues (overlfows) if the kernel is not exact + // and thus we could get numerical issues (overflows) if the kernel is not exact if(angle == 90) return 0; else @@ -1034,7 +1034,7 @@ bool extrude_skeleton(const PolygonWithHoles& pwh, // build a soup, to be converted to a mesh afterwards std::vector points; std::vector > faces; - points.reserve(2 * pwh.outer_boundary().size()); // just a reasonnable guess + points.reserve(2 * pwh.outer_boundary().size()); // just a reasonable guess faces.reserve(2 * pwh.outer_boundary().size() + 2*pwh.number_of_holes()); Extrusion_builder builder(gt); diff --git a/Straight_skeleton_extrusion_2/package_info/Straight_skeleton_extrusion_2/description.txt b/Straight_skeleton_extrusion_2/package_info/Straight_skeleton_extrusion_2/description.txt index 7b6e45eb158d..28d57ee0da41 100644 --- a/Straight_skeleton_extrusion_2/package_info/Straight_skeleton_extrusion_2/description.txt +++ b/Straight_skeleton_extrusion_2/package_info/Straight_skeleton_extrusion_2/description.txt @@ -1 +1 @@ -Given a 2D stricly simple polygon, possibly with weights, and a set of angles associated to edges, construct the extruded polygon using a straight skeleton. +Given a 2D strictly simple polygon, possibly with weights, and a set of angles associated to edges, construct the extruded polygon using a straight skeleton. diff --git a/Stream_support/package_info/Stream_support/long_description.txt b/Stream_support/package_info/Stream_support/long_description.txt index bb88707737db..6cb10849c3c5 100644 --- a/Stream_support/package_info/Stream_support/long_description.txt +++ b/Stream_support/package_info/Stream_support/long_description.txt @@ -12,7 +12,7 @@ Stream_support Package - CGAL/IO/Verbose_ostream.h The class CGAL_Verbose_ostream is useful for debugging and - diagnostic output, for example in inplementing the member + diagnostic output, for example in implementing the member function `bool is_valid( bool verbose = false, ...)' of complex data structures. diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h index 7ff51e70ce0a..1b93e2153422 100644 --- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h +++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h @@ -458,7 +458,7 @@ class ARAP_parameterizer_3 const Faces_vector& faces, Cot_map ctmap) const { - // Since we loop faces, we are implicitely defining the weight of border halfedges as 0... + // Since we loop faces, we are implicitly defining the weight of border halfedges as 0... for(face_descriptor fd : faces) { halfedge_descriptor hd = halfedge(fd, mesh), hdb = hd; diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h index d4efce8934d3..a64dcf41c41e 100644 --- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h +++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h @@ -212,7 +212,7 @@ class MVC_post_processor_3 halfedge_descriptor bhd, const VertexUVMap uvmap) const { - // @fixme unefficient: use sweep line algorithms instead of brute force + // @fixme inefficient: use sweep line algorithms instead of brute force for(halfedge_descriptor hd_1 : halfedges_around_face(bhd, mesh)) { for(halfedge_descriptor hd_2 : halfedges_around_face(bhd, mesh)) { @@ -385,7 +385,7 @@ class MVC_post_processor_3 // The other parts of A(i,j) and A(i,k) will be added when this function // is called from the neighboring faces of F_ijk that share the vertex i - // @fixme unefficient: lengths are computed (and inversed!) twice per edge + // @fixme inefficient: lengths are computed (and inversed!) twice per edge // Set w_i_base: - tan(alpha / 2) // Match order of the input points to the new weight implementation. @@ -436,7 +436,7 @@ class MVC_post_processor_3 // if vh_i is fixed, there is nothing to do: A(i,i)=1 and A(i,j)=0 for j!=i if(get(vpmap, vd_i)) { - // @fixme unefficient: A(i,i) is written as many times as i has neighbors + // @fixme inefficient: A(i,i) is written as many times as i has neighbors A.set_coef(i, i, 1); return; } @@ -496,7 +496,7 @@ class MVC_post_processor_3 // if vh_i is fixed, there is nothing to do: A(i,i)=1 and A(i,j)=0 for j!=i if(get(vpmap, vd_i)) { - // @fixme unefficient A(i,i) is written as many times as i has neighbors + // @fixme inefficient A(i,i) is written as many times as i has neighbors A.set_coef(i, i, 1); return; } diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h index 252f0864a1ea..151165423f94 100644 --- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h +++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h @@ -715,7 +715,7 @@ class Orbifold_Tutte_parameterizer_3 // The other parts of M(i,j) and M(i,k) will be added when this function // is called from the neighboring faces of F_ijk that share the vertex i - // @fixme unefficient: lengths are computed (and inversed!) twice per edge + // @fixme inefficient: lengths are computed (and inversed!) twice per edge // Set w_i_base: - tan(alpha / 2) const Point_3& p = pk; diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/edge_collapse.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/edge_collapse.h index bb0ed1c8ea67..5be0f4d1ef44 100644 --- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/edge_collapse.h +++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/edge_collapse.h @@ -50,7 +50,7 @@ the number of edges effectively removed. \cgalParamNEnd \cgalParamNBegin{get_placement} - \cgalParamDescription{a policy which returns the placement (position of the replacemet vertex) for an edge} + \cgalParamDescription{a policy which returns the placement (position of the replacement vertex) for an edge} \cgalParamType{a model of the concept `GetPlacement`} \cgalParamDefault{`CGAL::Surface_mesh_simplification::LindstromTurk_placement`} \cgalParamNEnd diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h index 036d5bb9b447..a9e6f7e8d5ba 100644 --- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h +++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h @@ -49,7 +49,7 @@ class Bounded_normal_change_filter if(op) { // triangles returns the triangles of the star of the vertices of the edge to collapse - // First the two trianges incident to the edge, then the other triangles + // First the two triangles incident to the edge, then the other triangles // The second vertex of each triangle is the vertex that gets placed const typename Profile::Triangle_vector& triangles = profile.triangles(); if(triangles.size() > 2) diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h index 1a1b9aafd129..a7b5521dbee8 100644 --- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h +++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h @@ -47,7 +47,7 @@ class Bounded_normal_change_placement if(op) { // triangles returns the triangles of the star of the vertices of the edge to collapse - // First the two trianges incident to the edge, then the other triangles + // First the two triangles incident to the edge, then the other triangles // The second vertex of each triangle is the vertex that gets placed const typename Profile::Triangle_vector& triangles = profile.triangles(); if(triangles.size() > 2) diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_self_intersection.h b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_self_intersection.h index 483cdef89d78..aa31a56c8d4b 100644 --- a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_self_intersection.h +++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_self_intersection.h @@ -53,7 +53,7 @@ struct Intersect_facets if(v != Halfedge_const_handle()) { // found shared vertex: assert(h->vertex() == v->vertex()); - // geomtric check if the opposite segments intersect the triangles + // geometric check if the opposite segments intersect the triangles Triangle t1(h->vertex()->point(), h->next()->vertex()->point(), h->next()->next()->vertex()->point()); diff --git a/Surface_mesh_topology/include/CGAL/draw_face_graph_with_paths.h b/Surface_mesh_topology/include/CGAL/draw_face_graph_with_paths.h index 79ba01fedd09..16caafb4f27b 100644 --- a/Surface_mesh_topology/include/CGAL/draw_face_graph_with_paths.h +++ b/Surface_mesh_topology/include/CGAL/draw_face_graph_with_paths.h @@ -62,7 +62,7 @@ struct Graphics_scene_options_face_graph_with_paths : namespace draw_function_for_lcc { - // We need to re-use the namespace draw_function_for_lcc because we want to specialize + // We need to reuse the namespace draw_function_for_lcc because we want to specialize // the previous struct LCC_geom_utils // template // struct LCC_geom_utils; diff --git a/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp b/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp index 1f445d7ebc0a..799198f5c0ce 100644 --- a/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp +++ b/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp @@ -4,7 +4,7 @@ FUNDAMENTAL GROUP OF THE TORUS We know that the fundamental group of the torus is the direct product ZxZ Hence we can choose a path on a circle by choosing an pair of integers -The test generats all groups of four integers (i, j, k, l) between -5 and 5 and the associated paths pij and pkl with two different basepoints +The test generates all groups of four integers (i, j, k, l) between -5 and 5 and the associated paths pij and pkl with two different basepoints Then it verify that -> pij is contractible iff i==0 and j==0 -> pkl is contractible iff k==0 and l==0 diff --git a/Surface_mesher/include/CGAL/Surface_mesher/Implicit_surface_oracle_3.h b/Surface_mesher/include/CGAL/Surface_mesher/Implicit_surface_oracle_3.h index 27362bda2f88..94a33878d552 100644 --- a/Surface_mesher/include/CGAL/Surface_mesher/Implicit_surface_oracle_3.h +++ b/Surface_mesher/include/CGAL/Surface_mesher/Implicit_surface_oracle_3.h @@ -331,7 +331,7 @@ namespace CGAL { #ifdef CGAL_SURFACE_MESHER_DEBUG_CLIPPED_SEGMENT std::cerr << "=" << debug_point(surface, mid) << "\n"; #endif - // the following function conditionnally call + // the following function conditionally call // mid.set_on_surface(...) if mid has such a function. set_on_surface(mid, surface_identifiers_generator(value_at_p1, diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h index 1c1d0df3a067..47b7353fd799 100644 --- a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h +++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h @@ -62,8 +62,8 @@ namespace Surface_sweep_2 { * are calculated. * End * - * Convensions through out the code: - * In order to make the code as readable as possible, some convensions were + * Conventions through out the code: + * In order to make the code as readable as possible, some conventions were * made in regards to variable naming: * * xp - is the intersection point between two curves diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Event_comparer.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Event_comparer.h index f956a0b2ee4b..b23abba79c1e 100644 --- a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Event_comparer.h +++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Event_comparer.h @@ -62,7 +62,7 @@ class Event_comparer { Arr_curve_end m_index; // boundary conditions. public: - /*! Cosntruct. */ + /*! Constructor. */ Event_comparer(const Gt2* traits) : m_traits(traits) {} //!\name Function call operators diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h index 657ea92e9aa7..fe1060f71eba 100644 --- a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h +++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h @@ -488,7 +488,7 @@ void Surface_sweep_2::_remove_curve_from_status_line(Subcurve* leftCurve, return; } - // the subcurve will be removed for good from the stauts line, we need + // the subcurve will be removed for good from the status line, we need // to check for intersection between his two neighbors (below and above him) // but we need to make sure that its not the first or last subcurve // at the status line. @@ -827,13 +827,13 @@ void Surface_sweep_2::_create_intersection_point(const Point_2& xp, } else { if ((multiplicity % 2) == 1) { - // The mutiplicity of the intersection point is odd: Swap their + // The multiplicity of the intersection point is odd: Swap their // order to the right of this point. std::swap(c1,c2); e->add_curve_pair_to_right(c1, c2); } else { - // The mutiplicity of the intersection point is even, so they + // The multiplicity of the intersection point is even, so they // maintain their order to the right of this point. CGAL_assertion((multiplicity % 2) == 0); e->add_curve_pair_to_right(c1, c2); diff --git a/TDS_2/include/CGAL/Triangulation_data_structure_2.h b/TDS_2/include/CGAL/Triangulation_data_structure_2.h index f7c386b9d3f4..7eb651ef4074 100644 --- a/TDS_2/include/CGAL/Triangulation_data_structure_2.h +++ b/TDS_2/include/CGAL/Triangulation_data_structure_2.h @@ -1351,7 +1351,7 @@ void Triangulation_data_structure_2:: make_hole(Vertex_handle v, List_edges& hole) // delete the faces incident to v and v - // and return the dscription of the hole in hole + // and return the description of the hole in hole { CGAL_precondition(dimension() == 2); std::list to_delete; @@ -1604,7 +1604,7 @@ split_vertex(Vertex_handle v, Face_handle f1, Face_handle g1) Vertex_handle v3 = f1->vertex( ccw(i1) ); Vertex_handle v4 = g1->vertex( ccw(j1) ); - // lst is the list of faces adjecent to v stored in + // lst is the list of faces adjacent to v stored in // counterclockwise order from g2 to f1) inclusive. // the list idx contains the indices of v in the // faces in lst. @@ -2244,7 +2244,7 @@ Triangulation_data_structure_2:: vrml_output( std::ostream& os, Vertex_handle v, bool skip_infinite) const { // output to a vrml file style - // Point are assumed to be 3d points with a stream oprator << + // Point are assumed to be 3d points with a stream operator << // if non nullptr, v is the vertex to be output first // if skip_inf is true, the point in the first vertex is not output // and the faces incident to v are not output diff --git a/TDS_2/include/CGAL/Triangulation_ds_vertex_2.h b/TDS_2/include/CGAL/Triangulation_ds_vertex_2.h index e9e2597a2ddc..6bc98d43cb36 100644 --- a/TDS_2/include/CGAL/Triangulation_ds_vertex_2.h +++ b/TDS_2/include/CGAL/Triangulation_ds_vertex_2.h @@ -42,7 +42,7 @@ class Triangulation_ds_vertex_2 //ACCESS size_type degree(); //should be const - //Deprecated access to circulators - for bacward compatibility + //Deprecated access to circulators - for backward compatibility // the following should be const // when Face_circulator, Vertex_circulator and Edge_circulator // are created from diff --git a/TDS_3/include/CGAL/Triangulation_utils_3.h b/TDS_3/include/CGAL/Triangulation_utils_3.h index 80c8c507977c..58299cf071aa 100644 --- a/TDS_3/include/CGAL/Triangulation_utils_3.h +++ b/TDS_3/include/CGAL/Triangulation_utils_3.h @@ -55,7 +55,7 @@ template < class T > const int Triangulation_utils_base_3::cw_map[3] = {2, 0, 1}; // We derive from Triangulation_cw_ccw_2 because we still use cw() and ccw() -// in the 2D part of the code. Ideally, this should go away when we re-use +// in the 2D part of the code. Ideally, this should go away when we reuse // T2D entirely. struct Triangulation_utils_3 diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt index 4835279b2937..e8d94344cfc1 100644 --- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt +++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt @@ -74,7 +74,7 @@ Tetrahedral mesh, modified by our tetrahedral remeshing method. dihedral angles in the interval [0.1; 179.8], 33,936 vertices. (Middle) After remeshing with uniform sizing field, - targetting the average edge length of input (left) mesh; + targeting the average edge length of input (left) mesh; dihedral angles in the interval [9.8; 165.5], 301,127 vertices. (Right) After remeshing with adaptive sizing field; diff --git a/Three/include/CGAL/Three/Scene_group_item.h b/Three/include/CGAL/Three/Scene_group_item.h index 558c21e53016..52b2bcc53ff5 100644 --- a/Three/include/CGAL/Three/Scene_group_item.h +++ b/Three/include/CGAL/Three/Scene_group_item.h @@ -109,21 +109,21 @@ public : //! //! Calls `Scene_item::draw()`, then calls `Scene_item::drawEdges()` //! and `Scene_item::drawPoints` for each child if its current - //! rendering mode is adequat. + //! rendering mode is adequate. //! @see #RenderingMode virtual void draw(CGAL::Three::Viewer_interface*) const override; //!\brief draws all the children //! //! Calls `Scene_item::drawEdges()`, then calls `Scene_item::draw()` //! and `Scene_item::drawPoints` for each child if its current - //! rendering mode is adequat. + //! rendering mode is adequate. //! @see #RenderingMode virtual void drawEdges(CGAL::Three::Viewer_interface*) const override; //!\brief draws all the children //! //! Calls `Scene_item::drawPoints()`, then calls `Scene_item::draw()` //! and `Scene_item::drawEdges()` for each child if its current - //! rendering mode is adequat. + //! rendering mode is adequate. //! @see #RenderingMode virtual void drawPoints(CGAL::Three::Viewer_interface*) const override; //! diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt index 17ae1a6e24bd..fb97a042599a 100644 --- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt +++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt @@ -1253,7 +1253,7 @@ information or functionality in the vertices and faces. \subsection Triangulation_2ACyclicDependency A Cyclic Dependency -To insure flexibility, the triangulation data structure is templated by the +To ensure flexibility, the triangulation data structure is templated by the vertex and face base classes. Also since incidence and adjacency relations are stored in vertices and faces, the base classes have to know the types of handles on vertices and faces provided diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h index 5b2df86f1e0b..523a60945c4d 100644 --- a/Triangulation_3/include/CGAL/Triangulation_3.h +++ b/Triangulation_3/include/CGAL/Triangulation_3.h @@ -1624,7 +1624,7 @@ class Triangulation_3 // to make it more general one could have an internal function here // to remove v without touching its handle - // This insert must be from Delaunay (or the particular trian.) + // This insert must be from Delaunay (or the particular triangle.) // not the basic Triangulation_3. // Here we correct the recent triangulation (with decreased dimension) formed // in particular here a 2D (from 3D to 2D displacement) @@ -5371,7 +5371,7 @@ remove(Vertex_handle v, VertexRemover& remover, bool *could_lock_zone) } // The remove here uses the remover, but -// no function envolving hidden points +// no function involving hidden points // will be used in this internal version template < class Gt, class Tds, class Lds > template < class VertexRemover, class OutputItCells > @@ -5618,7 +5618,7 @@ move_if_no_collision(Vertex_handle v, const Point& p, if(((dim == 2) && (lt != OUTSIDE_AFFINE_HULL)) || ((lt == OUTSIDE_AFFINE_HULL) && (dim == 1))) { - // This is insert must be from Delaunay (or the particular trian.) + // This is insert must be from Delaunay (or the particular triangle.) // not Triangulation_3 ! Vertex_handle inserted = inserter.insert(p, lt, loc, li, lj); @@ -5687,7 +5687,7 @@ move_if_no_collision(Vertex_handle v, const Point& p, } } - // This is insert must be from Delaunay (or the particular trian.) + // This is insert must be from Delaunay (or the particular triangle.) // not Triangulation_3 ! Vertex_handle inserted = inserter.insert(p, lt, loc, li, lj); @@ -5915,7 +5915,7 @@ move_if_no_collision_and_give_new_cells(Vertex_handle v, const Point& p, ((lt == OUTSIDE_AFFINE_HULL) && (dim == 1))) { std::set cells_set; - // This is insert must be from Delaunay (or the particular trian.) + // This is insert must be from Delaunay (or the particular triangle.) // not Triangulation_3 ! Vertex_handle inserted = inserter.insert(p, lt, loc, li, lj); Cell_handle c = inserted->cell(), end = c; @@ -6004,7 +6004,7 @@ move_if_no_collision_and_give_new_cells(Vertex_handle v, const Point& p, std::set cells_set; - // This is insert must be from Delaunay (or the particular trian.) + // This is insert must be from Delaunay (or the particular triangle.) // not Triangulation_3 ! Vertex_handle inserted = inserter.insert(p, lt, loc, li, lj); diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_regular_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_regular_3.h index 798c40e2b5f4..edc962c4d9c9 100644 --- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_regular_3.h +++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_regular_3.h @@ -181,7 +181,7 @@ _test_cls_regular_3(const Triangulation &) T111.insert(wp1); T111.insert(wp2); T111.insert(wp3); - T111.insert(wp13); // it doesnot work inserting wp13 here + T111.insert(wp13); // it doesn't work inserting wp13 here T111.insert(wp4); T111.insert(wp5); T111.insert(wp6); diff --git a/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h b/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h index c6751c2a3cbd..20b6412a7af3 100644 --- a/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h +++ b/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h @@ -521,7 +521,7 @@ insert_outside_affine_hull_regular(const Point& p) if(orient2 == POSITIVE) conform = true; - // find smallest vertex this step garanties a unique triangulation + // find smallest vertex this step guarantees a unique triangulation Vertex_handle w = vertices_begin(); Vertices_iterator vi; for(vi=vertices_begin(); vi!=vertices_end(); ++vi) diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt index 437036f97efd..36676947fffb 100644 --- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt +++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt @@ -135,7 +135,7 @@ resulting Voronoi diagram. What we care about is that firstly the policy itself is consistent and, secondly, that the adaptation is also done in a consistent manner. The latter is the responsibility of the adaptor provided by this package, whereas the former is the -responsibility of the implementor of a policy. +responsibility of the implementer of a policy. In this package we currently provide two types of adaptation policies. The first one is the simplest: we reject no feature of the