function documentation fixes

 remove the repetition of the name of the function in its brief description
 add parenthesis for function matching "function\s+`[a-z0-9_]`"

Author: sloriot

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h

@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgArrangement2PointLocation
 
-The function `locate` performs a batched point-location operation on a 
+Performs a batched point-location operation on a 
 given arrangement. It accepts a range of query points, and locates each 
 point in the arrangement. The query results are returned through the output 
 iterator. Each query result is given as a pair of the query point and an

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_iostream.h

@@ -3,7 +3,7 @@ namespace CGAL {
   \defgroup PkgArrangement2Read CGAL::read()
   \ingroup PkgArrangement2IO
 
-The function `read` reads a given arrangement from a given input stream
+Reads a given arrangement from a given input stream
 using a specific input format.
 
 \cgalHeading{Requirements}
@@ -40,7 +40,7 @@ std::istream& read (Arrangement_2<Traits,Dcel>& arr,
   \defgroup PkgArrangement2Write CGAL::write()
   \ingroup PkgArrangement2IO
 
-The function `write` writes a given arrangement into a given output stream
+Writes a given arrangement into a given output stream
 using a specific output format.
 
 \cgalHeading{Requirements}

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_overlay_2.h

@@ -6,7 +6,7 @@ namespace CGAL {
 the output arrangement `res` to represent the overlaid arrangement.
 
 \details
-The function `overlay` computes the overlay of two input arrangement
+Computes the overlay of two input arrangement
 objects, and returns the overlaid arrangement. All three arrangements
 can be instantiated with different geometric traits classes and different
 <span class="textsc">Dcel</span> classes (encapsulated in the various topology-traits classes).
@@ -42,7 +42,7 @@ represent the overlaid arrangement. The function also constructs a
 consolidated set of curves that induce `res`.
 
 \details
-The function `overlay` computes the overlay of two input arrangement
+Computes the overlay of two input arrangement
 objects, and returns the overlaid arrangement. All three arrangements
 can be instantiated with different geometric traits classes and different
 <span class="textsc">Dcel</span> classes (encapsulated in the various topology-traits classes).

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h

@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgArrangement2Funcs
 
-The function `decompose` produces the symbolic vertical decomposition of a 
+Produces the symbolic vertical decomposition of a 
 given arrangement, performing a batched vertical ray-shooting query from 
 all arrangement vertices, such that every vertex is associated with a pair 
 of objects, one corresponds to the arrangement feature that lies below it, 

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h

@@ -1045,7 +1045,7 @@ void insert (Arrangement_2<Traits,Dcel>& arr,
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `do_intersect` checks if a given curve or \f$ x\f$-monotone 
+  Checks if a given curve or \f$ x\f$-monotone 
   curve intersects an existing arrangement's edges or vertices. 
 
   If the give curve is not an \f$ x\f$-monotone curve then the function 
@@ -1091,7 +1091,7 @@ bool do_intersect (
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `insert_non_intersecting_curve` inserts a given \f$ x\f$-monotone curve into a given 
+  Inserts a given \f$ x\f$-monotone curve into a given 
   arrangement, where the interior of the given curve is disjoint from all 
   existing arrangement vertices and edges. Under this assumption, it is 
   possible to locate the endpoints of the given curve in the arrangement, 
@@ -1129,7 +1129,7 @@ insert_non_intersecting_curve (Arrangement_2<Traits,Dcel>& arr,
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `insert_non_intersecting_curves` inserts a set of \f$ x\f$-monotone curves in a given 
+  Inserts a set of \f$ x\f$-monotone curves in a given 
   range into a given arrangement. The insertion is performed in an aggregated 
   manner, using the sweep-line algorithm. The input curves should be pairwise 
   disjoint in their interior and pairwise interior-disjoint from all existing 
@@ -1152,7 +1152,7 @@ void insert_non_intersecting_curves(Arrangement_2<Traits,Dcel>& arr,
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `insert_point` inserts a given point into a given arrangement. 
+  Inserts a given point into a given arrangement. 
   It uses a given point-location object to locate the given 
   point in the given arrangement. If the point conincides with an existing 
   vertex, there is nothing left to do; if it lies on an edge, the edge is 
@@ -1190,7 +1190,7 @@ insert_point (Arrangement_2<Traits,Dcel>& arr,
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `is_valid` checks the validity of a given arrangement. 
+  Checks the validity of a given arrangement. 
 
   Invokes the member function `arr.is_valid()` to verify the 
   topological correctness of the arrangement. Then it performs additional 
@@ -1214,7 +1214,7 @@ bool is_valid (const Arrangement_2<Traits, Dcel>& arr);
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `remove_edge` removes an edge given by one of the twin halfedges 
+  Removes an edge given by one of the twin halfedges 
   that forms it, from a given arrangement. Once the edge is removed, if the 
   vertices associated with its endpoints become isolated, they are removed as 
   well. The call `remove_edge(arr, e)` is equivalent to the call 
@@ -1246,7 +1246,7 @@ remove_edge (Arrangement_2<Traits,Dcel>& arr,
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `remove_vertex` attempts to removed a given vertex from a given 
+  Attempts to removed a given vertex from a given 
   arrangement. The vertex can be removed if it is either an isolated vertex, 
   (and has no incident edge,) or if it is a <I>redundant</I> vertex. That 
   is, it has exactly two incident edges, whose associated curves can be 
@@ -1271,7 +1271,7 @@ bool remove_vertex (Arrangement_2<Traits,Dcel>& arr,
 /*!
   \ingroup PkgArrangement2Funcs
 
-  The function `zone` compute the zone of the given \f$ x\f$-monotone 
+  Compute the zone of the given \f$ x\f$-monotone 
   curve in the existing arrangement. Meaning, it output the 
   arrangement's vertices, edges and faces that the \f$ x\f$-monotone curve 
   intersects. The order of the objects is the order that they are 

Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h

@@ -310,9 +310,9 @@ void insert(Arrangement_with_history_2<Traits,Dcel>& arr,
 /*!
 \ingroup PkgArrangement2Funcs
 
-The function `remove_curve` removes a given curve from a given arrangement. 
+Removes a given curve from a given arrangement. 
 
-`remove_curve` removes a curve, specified by its handle `ch`, from 
+The curve is specified by its handle `ch`, from 
 the arrangement `arr`, by deleting all the edges it induces. The 
 function returns the number of deleted edges. 
 

Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h

@@ -5,7 +5,7 @@ namespace CGAL {
 
 The class `Rectangular_p_center_default_traits_2` defines types and operations 
 needed to compute rectilinear \f$ p\f$-centers of a planar point set 
-using the function `rectangular_p_center_2`. 
+using the function `rectangular_p_center_2()`. 
 
 
 \tparam K must be a model for `Kernel`. 
@@ -196,7 +196,7 @@ construct_iso_rectangle_2_above_right_point_2_object() const;
 /*!
 \ingroup PkgBoundingVolumes
 
-The function `rectangular_p_center_2` computes rectilinear 
+Computes rectilinear 
 \f$ p\f$-centers of a planar point set, i.e.\ a set of \f$ p\f$ points such 
 that the maximum minimal \f$ L_{\infty}\f$-distance between both sets is 
 minimized. 

Bounding_volumes/doc/Bounding_volumes/Concepts/Circle.h

@@ -22,10 +22,10 @@ Point type.
 typedef unspecified_type Point;
 
 /*!
-Distance type. The function `squared_radius` (see below)
+Distance type. The function `squared_radius()` (see below)
 returns an object of this type.
 
-\note Only needed, if the member function `is_valid`
+\note Only needed, if the member function `is_valid()`
 of `Min_circle_2` is used.
 
 */
@@ -128,15 +128,15 @@ bool  is_degenerate( ) const;
 
 returns `true`, iff `circle` and `circle2` are equal.
 
-\note Only needed, if the member function `is_valid` of `Min_circle_2` is used.
+\note Only needed, if the member function `is_valid()` of `Min_circle_2` is used.
 */
 bool  operator == ( const Circle& circle2) const;
 
 
 /*!
 returns the center of `circle`.
 
-\note Only needed, if the member function `is_valid` of `Min_circle_2` is used.
+\note Only needed, if the member function `is_valid()` of `Min_circle_2` is used.
 */
 Point  center( ) const;
 
@@ -145,7 +145,7 @@ Point  center( ) const;
 
 returns the squared radius of `circle`.
 
-\note Only needed, if the member function `is_valid` of `Min_circle_2` is used.
+\note Only needed, if the member function `is_valid()` of `Min_circle_2` is used.
 */
 Distance  squared_radius( ) const;
 

Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt

@@ -259,7 +259,7 @@ CGAL::box_self_intersection_d( ptr.begin(), ptr.end(), report_inters);
 
 \endcode
 
-In addition, the callback function `report_inters` needs to be
+In addition, the callback function `report_inters()` needs to be
 changed to work with pointers to boxes. The full example program looks
 as follows:
 
@@ -314,7 +314,7 @@ box at the center and the box from the upper-right corner of the grid.
 We write a more involved callback function object `Report` that
 stores an output iterator and writes the `id`-number of the 
 box in the first argument to the output iterator. We also provide a
-small helper function `report` that simplifies the use of the function
+small helper function `report()` that simplifies the use of the function
 object.
 
 We call the box intersection algorithm twice; once for the default

Circulator/doc/Circulator/CGAL/circulator.h

@@ -315,7 +315,7 @@ circulator category for iterators, i.e.\ one of
 
 \cgalHeading{Example}
 
-A generic function `bar` that distinguishes between a call with a
+A generic function `bar()` that distinguishes between a call with a
 circulator range and a call with an iterator range:
 
 \code{.cpp}
@@ -545,15 +545,15 @@ In order to write algorithms that work with iterator ranges as well as
 with circulator ranges we have to consider the difference of
 representing an empty range. For iterators this is the range `[i,i)`,
 while for circulators it would be `c == NULL`, the empty sequence test.
-The function `is_empty_range` provides the necessary generic test
+The function `is_empty_range()` provides the necessary generic test
 which accepts an iterator range or a circulator range and says whether
 the range is empty or not.
 
 \pre `IC` is either a circulator or an iterator type. The range `[i, j)` is valid.
 
 \cgalHeading{Example}
 
-The following function `process_all` accepts a range `[i, j)` of an iterator or circulator `IC` and processes each
+The following function `process_all()` accepts a range `[i, j)` of an iterator or circulator `IC` and processes each
 element in this range:
 
 \code{.cpp}
@@ -642,12 +642,12 @@ In order to write algorithms that work with iterator ranges as well as
 with circulator ranges we have to consider the difference of
 representing an empty range. For iterators this is the range `[i,i)`,
 while for circulators it would be `c == NULL`, the empty sequence test.
-The function `is_empty_range` provides the necessary generic test
+The function `is_empty_range()` provides the necessary generic test
 which accepts an iterator range or a circulator range and says whether
 the range is empty or not.
 
 A macro `CGAL_For_all( i, j)` simplifies the writing of such simple
-loops as the one in the example of the function `is_empty_range`.
+loops as the one in the example of the function `is_empty_range()`.
 `i` and `j` can be either iterators or circulators. The macro
 loops through the range `[i, j)`. It increments `i` until it
 reaches `j`. The implementation looks like: