From 0469f46105d65dcb720bf33785e14a3f6f329c4b Mon Sep 17 00:00:00 2001 From: Nuno Miguel Nobre Date: Tue, 20 Jun 2023 12:30:19 +0100 Subject: [PATCH] Fix plurals in a number of manuals --- .../doc/Documentation/Developer_manual/cmakelist_script.txt | 2 +- Mesh_3/doc/Mesh_3/Mesh_3.txt | 2 +- Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Periodic_3_mesh_3.txt | 2 +- .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt | 2 +- Polyhedron/doc/Polyhedron/Polyhedron.txt | 2 +- TDS_2/doc/TDS_2/TDS_2.txt | 2 +- .../doc/Triangulation_on_sphere_2/Triangulation_on_sphere_2.txt | 2 +- 7 files changed, 7 insertions(+), 7 deletions(-) diff --git a/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt b/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt index 64ce1695e41..7b451bf8178 100644 --- a/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt +++ b/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt @@ -31,7 +31,7 @@ linked. Valid options are, for instance, "filesystem" or "program_options". -This options should suffice to create `CMakeLists.txt` script +These options should suffice to create a `CMakeLists.txt` script for most directories containing programs. However, in some special cases, it might still be required to create the script manually, for instance, if some source files/executables need a different linking than diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt index b7057a757a2..521e98a0e1f 100644 --- a/Mesh_3/doc/Mesh_3/Mesh_3.txt +++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt @@ -422,7 +422,7 @@ Specifically, it is either a constant or a spatially variable scalar field. It provides an upper bound for the distance between the circumcenter of a surface facet and the center of a surface Delaunay ball of this facet. -
  • `facet_topology`. This parameters controls the set of topological constraints +
  • `facet_topology`. This parameter controls the set of topological constraints which have to be verified by each surface facet. By default, each vertex of a surface facet has to be located on a surface patch, on a curve, or on a corner. It can also be set to check whether the three vertices of a surface facet belongs to the same diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Periodic_3_mesh_3.txt b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Periodic_3_mesh_3.txt index 42596b249c3..af9f3482326 100644 --- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Periodic_3_mesh_3.txt +++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Periodic_3_mesh_3.txt @@ -375,7 +375,7 @@ Specifically, it is either a constant or a spatially variable scalar field. It provides an upper bound for the distance between the circumcenter of a surface facet and the center of a surface Delaunay ball of this facet. -
  • `facet_topology`. This parameters controls the set of topological constraints +
  • `facet_topology`. This parameter controls the set of topological constraints which have to be verified by each surface facet. By default, each vertex of a surface facet has to be located on a surface patch, on a curve, or on a corner. It can also be set to check whether the three vertices of a surface facet belongs to the same diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt index f414898362f..8d541588736 100644 --- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt +++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt @@ -569,7 +569,7 @@ The following running times were observed: *************************************** \section PMPPredicates Predicates -This packages provides several predicates to be evaluated with respect to a triangle mesh. +This package provides several predicates to be evaluated with respect to a triangle mesh. \subsection PMPDoIntersect Intersections Detection Intersection tests between triangle meshes and/or polylines can be done using diff --git a/Polyhedron/doc/Polyhedron/Polyhedron.txt b/Polyhedron/doc/Polyhedron/Polyhedron.txt index 6f986bd9e1e..cff55a73257 100644 --- a/Polyhedron/doc/Polyhedron/Polyhedron.txt +++ b/Polyhedron/doc/Polyhedron/Polyhedron.txt @@ -111,7 +111,7 @@ are provided too. The example continues with a test if the halfedge actually refers to a tetrahedron. This test checks the connected component referred to by the halfedge `h` and not the polyhedral -surface as a whole. This examples works only on the combinatorial +surface as a whole. This example works only on the combinatorial level of a polyhedral surface. The next example adds the geometry. \cgalExample{Polyhedron/polyhedron_prog_simple.cpp} diff --git a/TDS_2/doc/TDS_2/TDS_2.txt b/TDS_2/doc/TDS_2/TDS_2.txt index f326e6e1ebf..0f6184ea1c9 100644 --- a/TDS_2/doc/TDS_2/TDS_2.txt +++ b/TDS_2/doc/TDS_2/TDS_2.txt @@ -72,7 +72,7 @@ the set of maintained faces is topologically equivalent to a two-dimensional triangulated sphere. -This rules extends to lower dimensional triangulation data structure +This rule extends to lower dimensional triangulation data structure arising in degenerate cases or when the triangulations have fewer than three vertices. A one dimensional triangulation structure maintains a set of vertices diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Triangulation_on_sphere_2.txt b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Triangulation_on_sphere_2.txt index eb04ce3ebc2..287df7c9382 100644 --- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Triangulation_on_sphere_2.txt +++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Triangulation_on_sphere_2.txt @@ -143,7 +143,7 @@ Two traits classes are offered with this package as models of the concept `Delau for points on the sphere: given a point `p` in 3D space, this traits class manipulates directly its projection on the sphere (that is, the intersection of the sphere and the segment with endpoints `p` and the center of the sphere). Consequently, all points to be inserted are on the sphere. - This traits enable manipulating points that are not on the sphere, but whose triangulation + This traits class enables manipulating points that are not on the sphere, but whose triangulation on the sphere is still interesting, such as geographical coordinates with altitude.