diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib index 5cf02bd0237..bbdc960da4d 100644 --- a/Documentation/doc/biblio/geom.bib +++ b/Documentation/doc/biblio/geom.bib @@ -67256,7 +67256,7 @@ generated in O(dn2d+1) time. We present a simple proof that the (d - @article{gz-edcap-93 , author = "T. Gonzalez and S.-Q. Zheng" -, title = "An efficient divide and conquer approximation algorithm for partitionning into {D}-boxes" +, title = "An efficient divide and conquer approximation algorithm for partitioning into {D}-boxes" , journal = "Internat. J. Comput. Geom. Appl." , volume = 3 , year = 1993 diff --git a/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt b/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt index f23e9786f21..0f9732536f6 100644 --- a/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt +++ b/Point_set_processing_3/doc/Point_set_processing_3/Point_set_processing_3.txt @@ -635,7 +635,7 @@ Function `remove_outliers()` deletes a user-specified fraction of outliers from an input point set. More specifically, it partitions the input points with respect to the average squared distances to their nearest neighbors and deletes the points with largest value, either -partitionning with a threshold or removing a fixed percentage. The +partitioning with a threshold or removing a fixed percentage. The user can either specify a fixed number of nearest neighbors or a fixed spherical neighborhood radius. diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt index d3e8ff9837b..cf3d94bc7fa 100644 --- a/Polyhedron/demo/Polyhedron/CMakeLists.txt +++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt @@ -78,7 +78,7 @@ find_package(METIS) include(CGAL_METIS_support) set_package_properties( METIS PROPERTIES - DESCRIPTION "A library for partitionning." + DESCRIPTION "A library for partitioning." PURPOSE "Requiered for the partition plugin.") # Activate concurrency?