Remove whitespace

Alpha_shapes_3/doc/Alpha_shapes_3/Alpha_shapes_3.txt

@@ -146,7 +146,7 @@ such that the alpha shape satisfies the following two properties
 (i) all data points are either on the boundary or in the interior 
 of the regularized version of the alpha shape (no singular faces). 
 
-(ii) The number of components is equal or less than a given number .<BR>
+(ii) The number of components is equal or less than a given number.
 
 The current implementation is static, that is after its construction
 points cannot be inserted or removed.

Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt

@@ -69,7 +69,7 @@ in the chapter on 3D Boolean operations on Nef
 polyhedra \ref chapterNef3.
 
 Usually, an instance of `Nef_polyhedron_3` does not contain any
-redundant items. However, the function `convex_decomposition_3`
+redundant items. However, the function `::convex_decomposition_3`
 subdivides selected volumes of a given `Nef_polyhedron_3` by
 selected facets. These additional facets are therefore redundant,
 i.e., their insertion alters the representation of the polyhedron, but

Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3.h

@@ -10,7 +10,7 @@ and the plane equations of each face are not computed.
 \pre There are at least four points in the range 
 [`first`, `last`) not all of which are collinear.
 
-The function `convex_hull_3` computes the convex hull of a given set of 
+The function `::convex_hull_3` computes the convex hull of a given set of 
 three-dimensional points 
 Two versions of this function 
 are available. The first can be used when it is known that the result 
@@ -44,7 +44,7 @@ and for the second, it is required that
 For both versions, if the kernel `R` of the points determined by `InputIterator::value_type` 
 is a kernel with exact predicates but inexact constructions 
 (in practice we check `R::Has_filtered_predicates_tag` is `Tag_true` and `R::FT` is a floating point type), 
-then the default traits class of `convex_hull_3` is `Convex_hull_traits_3<R>`, and `R` otherwise. 
+then the default traits class of `::convex_hull_3` is `Convex_hull_traits_3<R>`, and `R` otherwise. 
 
 \sa `CGAL::convex_hull_incremental_3` 
 \sa `CGAL::ch_eddy` 
@@ -62,7 +62,7 @@ Example
 The following program computes the convex hull of a set of 250 random 
 points chosen from a sphere of radius 100. It then determines if the resulting 
 hull is a segment or a polyhedron. Notice that the traits class is not 
-necessary in the call to `convex_hull_3` but is used in the definition 
+necessary in the call to `::convex_hull_3` but is used in the definition 
 of `Polyhedron_3`. 
 
 \cgalexample{Convex_hull_3/quickhull_3.cpp} 

Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h

@@ -192,7 +192,7 @@ Convex_hull_d<R>(int d, R Kernel = R());
 /// @{
 
 /*!
-returns the dimension of ambient space
+returns the dimension of ambient space.
 */
 int dimension() ;
 

Convex_hull_d/doc/Convex_hull_d/Convex_hull_d.txt

@@ -42,7 +42,7 @@ The convex hull class is parameterized by a traits class that provides
 model <I>e.g.</I>, `Homogeneous<RT>` or `Cartesian<FT>` for use 
 with `Convex_hull_d`, where the dimension is fixed to three.
 The validity of the computed convex hull can be checked using the
-member function `is_valid`, which implements the algorithm
+member function `::is_valid`, which implements the algorithm
 of Mehlhorn <I>et al.</I>\cite mnssssu-cgpvg-96 to determine if
 the vertices of a given polytope constitute a strongly convex point
 set or not.

Generator/doc/Generator/Generator.txt

@@ -40,7 +40,7 @@ distributed in a sphere (`Random_points_in_sphere_3`)
 or cube (`Random_points_in_cube_3`) or on the boundary of a sphere
 (`Random_points_on_sphere_3`).
 For generating 3D grid points, we provide the function 
-`points_on_cube_grid_3` that writes to
+`::points_on_cube_grid_3` that writes to
 an output iterator.
 
 For higher dimensions, input iterators are provided for random points uniformly 

Mesh_3/doc/Mesh_3/Mesh_3.txt

@@ -316,12 +316,12 @@ parameters::internal::Perturb_options perturb = parameters::perturb(),
 parameters::internal::Exude_options exude = parameters::exude()); 
 \endcode
 
-The function `make_mesh_3` generates from scratch a mesh
+The function `::make_mesh_3` generates from scratch a mesh
 of the input domain, while
-the function `refine_mesh_3` refines
+the function `::refine_mesh_3` refines
 an existing mesh of the input domain. Note that as the protection
 of 0- and 1-dimensional features does not rely on Delaunay 
-refinement, the function `refine_mesh_3` has no parameter
+refinement, the function `r::efine_mesh_3` has no parameter
 to preserve features.
 
 ## The data structure ##
@@ -499,8 +499,8 @@ appropriate values of these types:
 These parameters are optional and can be passed in any order.
 If one parameter is not passed the default value is used. By default,
 only the perturber and the exuder are activated.
-Note that whatever may be the optimization processes activated by `make_mesh_3`
-or `refine_mesh_3`,
+Note that whatever may be the optimization processes activated by `::make_mesh_3`
+or `::refine_mesh_3`,
 they are always launched in the order that is a suborder 
 of the following:
 `odt smoother`, `Lloyd smoother`, `perturber` and 
@@ -657,7 +657,7 @@ domain. We add by hand the intersection of the spheres as a sharp feature.
 \anchor Mesh_3_subsection_examples_optimization
 
 In the previous examples, the mesh generation is launched through a call
-`make_mesh_3(domain,criteria)` with a minimal number of parameters. In such cases, 
+`::make_mesh_3(domain,criteria)` with a minimal number of parameters. In such cases, 
 the default optimization strategy is applied: after the Delaunay refinement process
 two optimization steps are performed, a perturbation and a sliver exudation.
 The following examples show how to disable default optimization steps 
@@ -671,10 +671,10 @@ a perturbation phase which is launched with no time bound
 and an objective of 10 degrees for the minimum dihedral angle
 of the mesh.
 The example shows two ways of achieving the same result. The first way
-issues a single call to `make_mesh_3` with the required optimization 
-process activated and tuned. In the second way, `make_mesh_3` is first called
+issues a single call to `::make_mesh_3` with the required optimization 
+process activated and tuned. In the second way, `::make_mesh_3` is first called
 without any optimization process and the resulting mesh is next optimized
-through a call to `perturb_mesh_3` with tuned parameters.
+through a call to `::perturb_mesh_3` with tuned parameters.
 
 \cgalexample{Mesh_3/mesh_optimization_example.cpp}
 

Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt

@@ -398,7 +398,7 @@ Therefore, the `Exact_predicates_inexact_constructions_kernel` should be used.
 
 \cgalexample{Straight_skeleton_2/Low_level_API.cpp}
 
-## Exterior Skeletons and Exterior Offset contours ##
+## Exterior Skeletons and Exterior Offset Contours ##
 
 This \cgal package can only construct the straight skeleton and offset contours in the <I>interior</I> of a polygon with holes. However, constructing exterior skeletons and exterior offsets is possible: