diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h index 00b2dfcd689..f1f45aab56c 100644 --- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h +++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes.h @@ -789,7 +789,7 @@ public: if(Base::bitstream_tree.max_var(curr) == 1) { ++curr; ++curr_mark; - //AcX_DSTREAM("nothing happend" << std::endl); + //AcX_DSTREAM("nothing happened" << std::endl); } else { newly_created = diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h index 42040ac1d56..036e21226bc 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h @@ -15,7 +15,7 @@ public: /// @{ /*! computes the intersections of `xc1` and `xc2` and writes them in an - * ascending lexicographic \f$xy\f$-order into a range begining at + * ascending lexicographic \f$xy\f$-order into a range beginning at * `oi`. The type `OutputIterator` must dereference a polymorphic object of * type `boost::variant` that wraps objects of type either type * `pair` or diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h index 7e95f4e4dc4..a2fc977951f 100644 --- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h +++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h @@ -14,7 +14,7 @@ public: /// @{ /*! subdivides the input curve `c` into \f$x\f$-monotone subcurves and - * isolated points, and inserts the results into a range begining at the given + * isolated points, and inserts the results into a range beginning at the given * output iterator `oi`. The type `OutputIterator` dereferences a * `boost::variant` that wraps either an `ArrTraits::Point_2` object or an * `ArrTraits::X_monotone_curve_2` object. The operator returns a past-the-end diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h index 01c3860dbf3..99c80b228df 100644 --- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h +++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h @@ -815,7 +815,7 @@ public: right_overlap = false; - //! EF: the following code is abit suspicious. It may erroneously + //! EF: the following code is a bit suspicious. It may erroneously // assume that the subcurves cannot overlap more than once. if (! right_coincides && ! left_coincides) { // Non of the endpoints of the current subcurve of one polycurve diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h index 46d56ab6f0d..8dbf094888f 100644 --- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h +++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h @@ -1848,7 +1848,7 @@ public: /* The traits class which the basic traits adaptor accepts as a template * parameter is a model of the ArrangementBasicTraits_2 concept so it - * needs not to support intersections at all, therefor it is complicated + * needs not to support intersections at all, therefore it is complicated * to check if the x-curves are disjoint in their interiors. Moreover, * compare_y_position functor is called only from the arrangement class * itself (and some related point-location algorithms), and used only diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h index 76efa0e5073..ec0153358c7 100644 --- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h +++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h @@ -17,7 +17,7 @@ public: /// @{ /*! computes the intersections of `xc1` and `xc2` and inserts them in an - * ascending lexicographic \f$ xy\f$-order into a range begining at + * ascending lexicographic \f$ xy\f$-order into a range beginning at * `oi`. The type `OutputIterator` dereferences a `boost::variant` of either the * type `pair` or the type diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h index 42b33b64514..56564f2ff7b 100644 --- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h +++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_on_surface_base_2_impl.h @@ -348,7 +348,7 @@ _insert(const Polygon_2& pgn, Arrangement_on_surface_2 & arr) } Face_const_handle const_f; - // face should not be contained as the pgn is completly disjoint of the + // face should not be contained as the pgn is completely disjoint of the // arrangement. CGAL_assertion(CGAL::assign(const_f, obj_f) && !const_f->contained()); CGAL::assign(const_f, obj_f); diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib index bbdc960da4d..5accc7df7aa 100644 --- a/Documentation/doc/biblio/geom.bib +++ b/Documentation/doc/biblio/geom.bib @@ -52819,7 +52819,7 @@ library." , year = 1992 , pages = "994--1008" , succeeds = "etw-otama-90" -, annote = "Basicly a generalization of switching. If we can't +, annote = "Basically a generalization of switching. If we can't improve the worst triangle by a switching look for a an edge splitting the largest angle that crosses several edges." diff --git a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in index 91788fdfab7..0b6dd035849 100644 --- a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in @@ -1087,7 +1087,7 @@ HTML_STYLESHEET = ${CGAL_DOC_RESOURCE_DIR}/stylesheet.css # user-defined cascading style sheet that is included after the standard # style sheets created by doxygen. Using this option one can overrule # certain style aspects. This is preferred over using HTML_STYLESHEET -# since it does not replace the standard style sheet and is therefor more +# since it does not replace the standard style sheet and is therefore more # robust against future updates. Doxygen will copy the style sheet file to # the output directory. diff --git a/Installation/cmake/modules/CGALConfig_binary.cmake.in b/Installation/cmake/modules/CGALConfig_binary.cmake.in index 01fae62d34a..be8ef0bae93 100644 --- a/Installation/cmake/modules/CGALConfig_binary.cmake.in +++ b/Installation/cmake/modules/CGALConfig_binary.cmake.in @@ -4,7 +4,7 @@ # This file is loaded by cmake via the command "find_package(CGAL)" # # This file correspond to a possibly out-of-sources CGAL configuration, thus the actual location -# must be given by the cmake variable or enviroment variable CGAL_DIR. +# must be given by the cmake variable or environment variable CGAL_DIR. set(CGAL_CONFIG_LOADED TRUE) diff --git a/Installation/cmake/modules/CGALConfig_install.cmake.in b/Installation/cmake/modules/CGALConfig_install.cmake.in index e11acd78522..bebbc210ad2 100644 --- a/Installation/cmake/modules/CGALConfig_install.cmake.in +++ b/Installation/cmake/modules/CGALConfig_install.cmake.in @@ -4,7 +4,7 @@ # This file is loaded by cmake via the command "find_package(CGAL)" # # This file correspond to a CGAL installation with "make install", thus the actual location -# must be given by the cmake variable or enviroment variable CGAL_DIR. +# must be given by the cmake variable or environment variable CGAL_DIR. set(CGAL_CONFIG_LOADED TRUE) diff --git a/Installation/cmake/modules/CGAL_GeneratorSpecificSettings.cmake b/Installation/cmake/modules/CGAL_GeneratorSpecificSettings.cmake index 366378ea74e..b46f288685c 100644 --- a/Installation/cmake/modules/CGAL_GeneratorSpecificSettings.cmake +++ b/Installation/cmake/modules/CGAL_GeneratorSpecificSettings.cmake @@ -4,7 +4,7 @@ if ( NOT CGAL_GENERATOR_SPECIFIC_SETTINGS_FILE_INCLUDED ) message( STATUS "Targetting ${CMAKE_GENERATOR}") if ( MSVC ) - message( STATUS "Target build enviroment supports auto-linking" ) + message( STATUS "Target build environment supports auto-linking" ) set(CGAL_AUTO_LINK_ENABLED TRUE) endif() diff --git a/Nef_3/archive/triangulation/include/CGAL/partition_is_valid_2.h b/Nef_3/archive/triangulation/include/CGAL/partition_is_valid_2.h index 584981269c0..10d67bb099c 100644 --- a/Nef_3/archive/triangulation/include/CGAL/partition_is_valid_2.h +++ b/Nef_3/archive/triangulation/include/CGAL/partition_is_valid_2.h @@ -228,10 +228,10 @@ partition_is_valid_2 (InputIterator point_first, InputIterator point_last, traits); } -template +template bool partition_is_valid_2 (InputIterator point_first, InputIterator point_last, - FowardIterator poly_first, FowardIterator poly_last) + ForwardIterator poly_first, ForwardIterator poly_last) { typedef typename std::iterator_traits::value_type Point_2; typedef typename Kernel_traits::Kernel K; diff --git a/Nef_3/include/CGAL/Nef_3/Edge_edge_overlay.h b/Nef_3/include/CGAL/Nef_3/Edge_edge_overlay.h index 15bd895a186..df23689d98c 100644 --- a/Nef_3/include/CGAL/Nef_3/Edge_edge_overlay.h +++ b/Nef_3/include/CGAL/Nef_3/Edge_edge_overlay.h @@ -796,7 +796,7 @@ public: if(!empty_c[1] && !empty_e[1]) { CGAL_assertion(first_first == empty_c[0]); - if(first_first) { // nothing happend on the other half + if(first_first) { // nothing happened on the other half if(equator[2] || equator[3]) { first_first = false; previous_first = sv[3]->out_sedge(); diff --git a/Nef_3/include/CGAL/Nef_3/SNC_external_structure.h b/Nef_3/include/CGAL/Nef_3/SNC_external_structure.h index 43ef20dafb5..c03e212fdfd 100644 --- a/Nef_3/include/CGAL/Nef_3/SNC_external_structure.h +++ b/Nef_3/include/CGAL/Nef_3/SNC_external_structure.h @@ -883,9 +883,9 @@ public: } } - // finaly, we go through all the Shells which do not correspond to a Volume - // and we assign them to its enclosing Volume determined via a facet below - // check. + // finally, we go through all the Shells which do not correspond to a Volume + // and we assign them to its enclosing Volume determined via a facet below + // check. CGAL_forall_sfaces(f,*this->sncp()) { // progress3++; diff --git a/Nef_S2/include/CGAL/Nef_S2/Sphere_geometry_OGL.h b/Nef_S2/include/CGAL/Nef_S2/Sphere_geometry_OGL.h index db3a99f3ad9..99fe923e4f4 100644 --- a/Nef_S2/include/CGAL/Nef_S2/Sphere_geometry_OGL.h +++ b/Nef_S2/include/CGAL/Nef_S2/Sphere_geometry_OGL.h @@ -200,7 +200,7 @@ class Approximator { else i=0; } // now i references the side of maximal angle - if ( angle[i] < refinement_angle ) // refinement threshhold + if ( angle[i] < refinement_angle ) // refinement threshold { T.push_back(t); return; } VVector v; switch (i) { diff --git a/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h b/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h index 209adf40028..f0be0a6ee5c 100644 --- a/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h +++ b/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h @@ -48,7 +48,7 @@ class Expr; namespace CGAL { namespace internal { -// Two classes which tell the prefered "exact number types" corresponding to a type. +// Two classes which tell the preferred "exact number types" corresponding to a type. // The default template chooses mpq_class, Gmpq, leda_rational, or Quotient. // It should support the built-in types. diff --git a/Partition_2/include/CGAL/Partition_2/partition_greene_approx_convex_2.h b/Partition_2/include/CGAL/Partition_2/partition_greene_approx_convex_2.h index e2259a19a69..8f3d54ce5dd 100644 --- a/Partition_2/include/CGAL/Partition_2/partition_greene_approx_convex_2.h +++ b/Partition_2/include/CGAL/Partition_2/partition_greene_approx_convex_2.h @@ -609,7 +609,7 @@ void find_smallest_yx(BidirectionalCirculator& first, const Traits& traits) current++; // find out which direction to go typename Traits::Less_yx_2 less_yx = traits.less_yx_2_object(); - if (less_yx(*current, *first)) // go foward + if (less_yx(*current, *first)) // go forward { do { diff --git a/Partition_2/include/CGAL/partition_is_valid_2.h b/Partition_2/include/CGAL/partition_is_valid_2.h index 2703ccc12f2..71ddd0d66e3 100644 --- a/Partition_2/include/CGAL/partition_is_valid_2.h +++ b/Partition_2/include/CGAL/partition_is_valid_2.h @@ -201,10 +201,10 @@ partition_is_valid_2 (InputIterator point_first, InputIterator point_last, } } // namespace internal -template +template bool partition_is_valid_2 (InputIterator point_first, InputIterator point_last, - FowardIterator poly_first, FowardIterator poly_last) + ForwardIterator poly_first, ForwardIterator poly_last) { typedef typename std::iterator_traits::value_type Point_2; typedef typename Kernel_traits::Kernel K; @@ -218,10 +218,10 @@ partition_is_valid_2 (InputIterator point_first, InputIterator point_last, } -template +template bool partition_is_valid_2 (InputIterator point_first, InputIterator point_last, - FowardIterator poly_first, FowardIterator poly_last, + ForwardIterator poly_first, ForwardIterator poly_last, const Traits& traits) { //typedef typename std::iterator_traits::value_type Point_2; diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/Scene.cpp b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/Scene.cpp index add660baac0..64ed148670d 100644 --- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/Scene.cpp +++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/Scene.cpp @@ -1368,7 +1368,7 @@ void Scene::gl_draw_location() { if (in_plane) { int i=0; int count = 0; - // Figure out whether there is a facet that is completly contained + // Figure out whether there is a facet that is completely contained // in the z=0 plane for (int j=0 ; j<4 ; j++) { if (ch->vertex(j)->point().z() != 0.0 || diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h index b1b663eb731..9f0bb5771a8 100644 --- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h +++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h @@ -53,7 +53,7 @@ namespace Polygon_mesh_processing { * @param tmesh a polygon mesh with triangulated surface patches to be smoothed. * @param faces the range of triangular faces defining one or several surface patches to be smoothed. * @param time a time step that corresponds to the speed by which the surface is smoothed. -* A larger time step results in faster convergence but details may be distorted to have a larger extent +* A larger time step results in faster convergence but details may be distorted to a larger extent * compared to more iterations with a smaller step. Typical values scale in the interval (1e-6, 1]. * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below * diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Diff_between_meshes_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Diff_between_meshes_plugin.cpp index 8ab19827c47..8b0c4afe385 100644 --- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Diff_between_meshes_plugin.cpp +++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Diff_between_meshes_plugin.cpp @@ -77,7 +77,7 @@ void Polyhedron_demo_diff_between_meshes_plugin::diff() QCursor c(Qt::WaitCursor); CGAL::Three::Three::CursorScopeGuard guard(c); - //Get the two meshes. No need to check their existance, applicable() + //Get the two meshes. No need to check their existence, applicable() //is not permissive enough to let it crash. Scene_surface_mesh_item* m1_item = qobject_cast( scene->item(scene->selectionIndices().front())), diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h index 45bb627538c..4de499eda0f 100644 --- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h +++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h @@ -50,7 +50,7 @@ protected: Q_FOREACH(QPointF p, points) { /*Translation(-w/2, -h/2) to recenter the scene, then - * Scaling then Rotation and finaly the Translation + * Scaling then Rotation and finally the Translation * + Translation(w/2+h/2) to put it back. */ //scaled values qreal sx(translation.z()* (p.x()-width() /2.0)), sy(translation.z()* (p.y()-height()/2.0)) ; diff --git a/Polyhedron/demo/Polyhedron/Server_ws.cpp b/Polyhedron/demo/Polyhedron/Server_ws.cpp index b6d84b6d441..0a0094db7a3 100644 --- a/Polyhedron/demo/Polyhedron/Server_ws.cpp +++ b/Polyhedron/demo/Polyhedron/Server_ws.cpp @@ -21,7 +21,7 @@ EchoServer::EchoServer(quint16 port) : } QHostAddress local_host("0.0.0.0"); - //to avoid printing 127.0.0.1. Not realy sure it won't ever print the external ipv4 though. + //to avoid printing 127.0.0.1. Not really sure it won't ever print the external ipv4 though. const QHostAddress &localhost = QHostAddress(QHostAddress::LocalHost); for (const QHostAddress &address: QNetworkInterface::allAddresses()) { if (address.protocol() == QAbstractSocket::IPv4Protocol && address != localhost) diff --git a/Polytope_distance_d/include/CGAL/Width_3.h b/Polytope_distance_d/include/CGAL/Width_3.h index b3b055379a2..f4e3e037c9f 100644 --- a/Polytope_distance_d/include/CGAL/Width_3.h +++ b/Polytope_distance_d/include/CGAL/Width_3.h @@ -1231,7 +1231,7 @@ class Width_3 { // *** ORIGIN_INSIDE_CH *** //------------------------- - // To ensure that zero lies completly inside the convex hull of a point set. + // To ensure that zero lies completely inside the convex hull of a point set. // Returns true if the point set is not coplanar, false otherwise // PRECONDITION: Iterator range has at least 3 points template diff --git a/STL_Extension/include/CGAL/Handle_with_policy.h b/STL_Extension/include/CGAL/Handle_with_policy.h index ca34fff19cf..8a5e7ebae8a 100644 --- a/STL_Extension/include/CGAL/Handle_with_policy.h +++ b/STL_Extension/include/CGAL/Handle_with_policy.h @@ -275,7 +275,7 @@ public: //! the virtual destructor is essential for proper memory management here. virtual ~Reference_counted_hierarchy() {} //! can be used to minimize memory consumption once it is known that this - //! representation is not used anymore and only needed to keep a fowarding + //! representation is not used anymore and only needed to keep a forwarding //! pointer. One example would be cleaning up dynamically allocated //! data, or another example would be overwriting a \c leda::real with //! a default constructed value to free its old expression tree. However, diff --git a/Scripts/developer_scripts/autotest_cgal b/Scripts/developer_scripts/autotest_cgal index e0b985e0339..079260d565d 100755 --- a/Scripts/developer_scripts/autotest_cgal +++ b/Scripts/developer_scripts/autotest_cgal @@ -24,7 +24,7 @@ #sets the umask to 022 & 0777 umask 022 -# Warn deprecated use of enviroment variables to pass on flags +# Warn deprecated use of environment variables to pass on flags if [ -n "$TESTSUITE_CXXFLAGS" ] ; then echo "\$TESTSUITE_CXXFLAGS is deprecated. Please use the CMAKE variable (CMAKE|CGAL)_CXX_FLAGS instead" >&2; fi diff --git a/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_k.h b/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_k.h index 001852c7f09..cec706fd6dc 100644 --- a/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_k.h +++ b/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_k.h @@ -11,7 +11,7 @@ window queries, enclosing queries, and inverse range queries on the keys. The cl a segment tree traits class `Traits` that defines, among other things, the type of the `Interval`. In order to perform an inverse range query, a range query of -\f$ \epsilon\f$ width has to be performed. We prefered not to offer an +\f$ \epsilon\f$ width has to be performed. We preferred not to offer an extra function for this sort of query, since the inverse range query is a special case of the range query. Furthermore, offering an inverse range query in the segment tree class implies offering this diff --git a/SearchStructures/doc/SearchStructures/SearchStructures.txt b/SearchStructures/doc/SearchStructures/SearchStructures.txt index cbdc9928b2b..fd27bfc4fec 100644 --- a/SearchStructures/doc/SearchStructures/SearchStructures.txt +++ b/SearchStructures/doc/SearchStructures/SearchStructures.txt @@ -94,7 +94,7 @@ type information the sublayers could be created. This approach lead to nested template arguments, since the sublayer tree can again have a template argument defining the sublayer. Therefore, the internal class and function identifiers got longer than a compiler-dependent limit. -This happend already for ` d=2`. +This happened already for ` d=2`. Therefore, we chose another, object oriented, design. We defined a pure diff --git a/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Path_on_surface_with_rle.h b/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Path_on_surface_with_rle.h index 34ca3e55ecc..7dd61d8c9aa 100644 --- a/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Path_on_surface_with_rle.h +++ b/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Path_on_surface_with_rle.h @@ -151,7 +151,7 @@ public: /// Both cannot be true at the same time. /// Note that for a minimal surface of genus>=2, we cannot have both -2 and /// +2 as turn, and thus these parameters are useless. - /// However, this case can occured for our unit tests on the cube, this is + /// However, this case can occurr for our unit tests on the cube, this is /// the reason of these parameters. Path_on_surface_with_rle(const MQ& aMQ, const Path_on_surface& apath, bool use_only_positive=false,