Remove hyphens in some words

Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Advancing_front_surface_reconstruction.txt

@@ -49,7 +49,7 @@ We describe next the algorithm and provide examples.
 
 \note A \ref tuto_reconstruction "detailed tutorial on surface reconstruction"
 is provided with a guide to choose the most appropriate method along
-with pre- and post-processing.
+with pre- and postprocessing.
 
 \section AFSR_Definitions Definitions and the Algorithm
 

Advancing_front_surface_reconstruction/include/CGAL/Advancing_front_surface_reconstruction.h

@@ -382,7 +382,7 @@ namespace CGAL {
     int _facet_number;
 
     //---------------------------------------------------------------------
-    // For post-processing
+    // For postprocessing
     mutable int _postprocessing_counter;
     int _size_before_postprocessing;
 
@@ -2432,7 +2432,7 @@ namespace CGAL {
 
       std::size_t itmp, L_v_size_mem;
       L_v_size_mem = L_v.size();
-      if ((vh_on_border_inserted != 0)&& // to post-process only the borders
+      if ((vh_on_border_inserted != 0)&& // to postprocess only the borders
           (L_v.size() < .1 * _size_before_postprocessing))
         {
           {

Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h

@@ -348,7 +348,7 @@ class Alpha_wrapper_3
 
 #ifdef CGAL_AW3_TIMER
       t.stop();
-      std::cout << "Manifoldness post-processing took: " << t.time() << " s." << std::endl;
+      std::cout << "Manifoldness postprocessing took: " << t.time() << " s." << std::endl;
       t.reset();
       t.start();
 #endif

Boolean_set_operations_2/doc/Boolean_set_operations_2/Boolean_set_operations_2.txt

@@ -116,7 +116,7 @@ In our context, a polygon must uphold the following conditions:
 <OL>
 <LI><I>Closed Boundary</I> - the polygon's outer boundary must be a connected sequence of curves, that start and end at the same vertex.
 <LI><I>Simplicity</I> - the polygon must be simple.
-<LI><I>Orientation</I> - the polygon's outer boundary must be <I>counter-clockwise oriented</I>.
+<LI><I>Orientation</I> - the polygon's outer boundary must be <I>counterclockwise oriented</I>.
 </OL>
 
 \subsection bso_ssecpolygon_with_holes_validation Conditions for Valid Polygons with Holes

Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_bfs_xor_visitor.h

@@ -52,7 +52,7 @@ public Gps_bfs_base_visitor<Arrangement_, Gps_bfs_xor_visitor<Arrangement_> >
     return (ic % 2) == 1;
   }
 
-  //! after_scan post-processing after bfs scan.
+  //! after_scan postprocessing after bfs scan.
 /*! The function fixes some of the curves, to be in the same direction as the
     half-edges.
 

Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h

@@ -137,7 +137,7 @@ class Compute_cone_boundaries_2<Exact_predicates_exact_constructions_kernel_with
 
       The direction of the first ray can be specified by the parameter
       initial_direction, which allows the first ray to start at any direction.
-      The remaining directions are calculated in counter-clockwise order.
+      The remaining directions are calculated in counterclockwise order.
 
       \param cone_number The number of cones
       \param initial_direction The direction of the first ray

Cone_spanners_2/include/CGAL/Construct_theta_graph_2.h

@@ -169,7 +169,7 @@ class Construct_theta_graph_2 {
     /* Construct edges in one cone bounded by two directions.
 
      \param cwBound      The direction of the clockwise boundary of the cone.
-     \param ccwBound     The direction of the counter-clockwise boundary.
+     \param ccwBound     The direction of the counterclockwise boundary.
      \param g            The Theta graph to be built.
     */
     void add_edges_in_cone(const Direction_2& cwBound, const Direction_2& ccwBound, Graph_& g) {

Cone_spanners_2/include/CGAL/Construct_yao_graph_2.h

@@ -164,7 +164,7 @@ class Construct_yao_graph_2 {
     /* Construct edges in one cone bounded by two directions.
 
      \param cwBound      The direction of the clockwise boundary of the cone.
-     \param ccwBound     The direction of the counter-clockwise boundary.
+     \param ccwBound     The direction of the counterclockwise boundary.
      \param g            The Yao graph to be built.
     */
     void add_edges_in_cone(const Direction_2& cwBound, const Direction_2& ccwBound, Graph_& g) {

Documentation/doc/Documentation/Tutorials/Tutorial_reconstruction.txt

@@ -255,7 +255,7 @@ through the points.
 
 Each of these methods produce a triangle mesh stored in different
 ways. If this output mesh is hampered by defects such as holes or
-self-intersections, \cgal provide several algorithms to post-process
+self-intersections, \cgal provide several algorithms to postprocess
 it (hole filling, remeshing, etc.) in the package \ref PkgPolygonMeshProcessing "Polygon Mesh Processing".
 
 We do not discuss these functions here as there are many

Documentation/doc/scripts/test_doxygen_versions.sh

@@ -91,7 +91,7 @@ else
   bash -$- ./compare_testsuites.sh $PWD/build_doc/doc_output $PWD/doc_ref 1> /dev/null
 fi
 echo "done."
-#add post-processing
+#add postprocessing
 cd ./build_doc
 echo "Adding postprocessing..."
 make -j$NB_CORES doc_with_postprocessing  &>> ./build_logs

Heat_method_3/doc/Heat_method_3/Heat_method_3.txt

@@ -149,7 +149,7 @@ Next, the gradient in a given triangle can be expressed as
 
 \f$\nabla u = \frac{1}{2 A_f} \sum_i u_i ( N \times e_i ) \f$
 
-where \f$A_f\f$ is the area of the triangle, \f$N\f$ is its outward unit normal, \f$e_i\f$ is the \f$i\f$th edge vector (oriented counter-clockwise), and \f$u_i\f$ is the value of \f$u\f$ at the opposing vertex. The integrated divergence associated with vertex \f$i\f$ can be written as
+where \f$A_f\f$ is the area of the triangle, \f$N\f$ is its outward unit normal, \f$e_i\f$ is the \f$i\f$th edge vector (oriented counterclockwise), and \f$u_i\f$ is the value of \f$u\f$ at the opposing vertex. The integrated divergence associated with vertex \f$i\f$ can be written as
 
 \f$\nabla \cdot X = \frac{1}{2} \sum_j cot\theta_1 (e_1 \cdot X_j) + cot \theta_2 (e_2 \cdot X_j)\f$
 

Jet_fitting_3/doc/Jet_fitting_3/Jet_fitting_3.txt

@@ -280,7 +280,7 @@ computed using rings on the triangulation. Results are twofold:
 numerical information on the computation: condition number and the
 PCA basis;
 <LI>another text file that records raw data (better for a visualization
-post-processing).
+postprocessing).
 </UL>
 
 \cgalFigureRef{figjet3figdavid} and

Mesh_2/include/CGAL/Mesh_2/Refine_edges_visitor.h

@@ -98,7 +98,7 @@ class Refine_edges_visitor : public ::CGAL::Null_mesh_visitor
     // set fh to the face at the right of [va,v]
 
     typename Tr::Face_circulator fc = tr.incident_faces(v, fh), fcbegin(fc);
-    // circulators are counter-clockwise, so we start at the right of
+    // circulators are counterclockwise, so we start at the right of
     // [va,v]
     do {
       if( !tr.is_infinite(fc) )

Mesh_3/include/CGAL/Labeled_mesh_domain_3.h

@@ -656,7 +656,7 @@ class Labeled_mesh_domain_3
    *    \cgalParamExtra{The return type of the function depends on whether this parameter
    *                    or `input_features` are provided or not.}
    *    \cgalParamExtra{If `weights` is provided, it must either be adapted to the detected features,
-   *                    or post-processed during feature detection to keep consistency
+   *                    or postprocessed during feature detection to keep consistency
    *                    of the output `MeshDomainWithFeatures_3`.
    *                    Available functors implement the necessary modifications.}
    *   \cgalParamNEnd

Nef_2/include/CGAL/Nef_2/PM_checker.h

@@ -95,12 +95,12 @@ bool is_forward(Halfedge_const_handle e) const
 
 void check_order_preserving_embedding(Vertex_const_handle v) const;
 /*{\Mop checks if the embedding of the targets of the edges in
-the adjacency list |A(v)| is counter-clockwise order-preserving with
+the adjacency list |A(v)| is counterclockwise order-preserving with
 respect to the order of the edges in |A(v)|.}*/
 
 void check_order_preserving_embedding() const;
 /*{\Mop checks if the embedding of all vertices of |P| is
-counter-clockwise order-preserving with respect to the adjacency
+counterclockwise order-preserving with respect to the adjacency
 list ordering of all vertices.}*/
 
 void check_forward_prefix_condition(Vertex_const_handle v) const;

Nef_S2/include/CGAL/Nef_S2/SM_checker.h

@@ -79,12 +79,12 @@ bool is_forward(Halfedge_const_handle e) const
 
 void check_order_preserving_embedding(Vertex_const_handle v) const;
 /*{\Mop checks if the embedding of the targets of the edges in
-the adjacency list |A(v)| is counter-clockwise order-preserving with
+the adjacency list |A(v)| is counterclockwise order-preserving with
 respect to the order of the edges in |A(v)|.}*/
 
 void check_order_preserving_embedding() const;
 /*{\Mop checks if the embedding of all vertices of |P| is
-counter-clockwise order-preserving with respect to the adjacency
+counterclockwise order-preserving with respect to the adjacency
 list ordering of all vertices.}*/
 
 void check_forward_prefix_condition(Vertex_const_handle v) const;

Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h

@@ -212,7 +212,7 @@ class Periodic_2_Delaunay_triangulation_2 : public Periodic_2_triangulation_2<Tr
   contains `p`. It outputs in the container pointed to by
   `eit` the boundary of the zone in conflict with `p`.
   The boundary edges of the conflict zone are output in
-  counter-clockwise order and each edge is described through its
+  counterclockwise order and each edge is described through its
   incident face which is not in conflict with `p`. The function
   returns in a std::pair the resulting output
   iterators. \pre `start` is in conflict with `p` and `p` lies in the original domain `domain`.

Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Hyperbolic_octagon_translation.h

@@ -124,7 +124,7 @@ class Hyperbolic_octagon_translation {
                 Comparison operator.
                  Each translation \f$g\f$ of \f$\mathcal G\f$, when applied to the octagon \f$\mathcal D_O\f$,
                  produces a copy of \f$\mathcal D_O\f$ labeled by the translation \f$g\f$. The copies of
-                 \f$\mathcal D_O\f$ incident to \f$\mathcal D_O\f$ are naturally ordered counter-clockwise around
+                 \f$\mathcal D_O\f$ incident to \f$\mathcal D_O\f$ are naturally ordered counterclockwise around
                  \f$\mathcal D_O\f$. The comparison operator compares two translations based on the ordering
                  of the copies of \f$\mathcal D_O\f$ that they produce. For more details, see Section
                  \ref P4HT2_representation of the User manual.

Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h

@@ -11,7 +11,7 @@ A refinement of the concept `TriangulationFaceBase_2` that adds an interface for
 
 At the base level, a face stores handles to its incident vertices and to its neighboring faces.
 Compare with Section \ref Section_2D_Triangulations_Software_Design of the 2D Triangulations
-package. The vertices and neighbors are indexed counter-clockwise 0, 1, and 2. Neighbor `i` lies
+package. The vertices and neighbors are indexed counterclockwise 0, 1, and 2. Neighbor `i` lies
 opposite to vertex `i`.
 
 For periodic hyperbolic triangulations, the face base class needs to store three hyperbolic

Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/PackageDescription.txt

@@ -54,7 +54,7 @@ Each face gives access to its three incident vertices and to its three adjacent
 to store additionally three hyperbolic translations. When applied to the three points stored in the vertices of
 the face, these translations produce the canonical representative of the face in the hyperbolic plane.
 
-The three vertices of a face are indexed with 0, 1, and 2 in positive (counter-clockwise) orientation. The
+The three vertices of a face are indexed with 0, 1, and 2 in positive (counterclockwise) orientation. The
 orientation of faces on the Bolza surface is defined as the orientation of their canonical representatives in
 the hyperbolic plane.
 

Poisson_surface_reconstruction_3/doc/Poisson_surface_reconstruction_3/Poisson_surface_reconstruction_3.txt

@@ -29,7 +29,7 @@ solving for the implicit function before function evaluation.
 
 \note A \ref tuto_reconstruction "detailed tutorial on surface reconstruction"
 is provided with a guide to choose the most appropriate method along
-with pre- and post-processing.
+with pre- and postprocessing.
 
 
 \section Poisson_surface_reconstruction_3Common Common Reconstruction Pipeline
@@ -45,7 +45,7 @@ and 6) Surface reconstruction.
 \cgal provides algorithms for all steps listed above except alignment.
 
 Chapter \ref chappoint_set_processing_3 "Point Set Processing"
-describes algorithms to pre-process the point set before
+describes algorithms to preprocess the point set before
 reconstruction with functions devoted to the simplification, outlier
 removal, smoothing, normal estimation and normal orientation.
 

Polygon_repair/doc/Polygon_repair/Polygon_repair.txt

@@ -123,7 +123,7 @@ strict criteria:
 - Adjacent collinear edges touching at vertices of degree two are merged
 - The sequence of vertices representing a boundary starts from its
 lexicographically smallest vertex
-- Outer boundaries are oriented counter-clockwise and inner boundaries are
+- Outer boundaries are oriented counterclockwise and inner boundaries are
 oriented clockwise
 - The inner boundaries of a polygon with holes are stored in lexicographic
 order

Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Scale_space_reconstruction_3.txt

@@ -19,7 +19,7 @@ A triangulated surface mesh is generated by first computing the point set at a c
 
 \note A \ref tuto_reconstruction "detailed tutorial on surface reconstruction"
 is provided with a guide to choose the most appropriate method along
-with pre- and post-processing.
+with pre- and postprocessing.
 
 
 \section ScaleSpaceReconstruction3secMethod Scale-Space
@@ -92,7 +92,7 @@ The surface mesh constructed at scale \f$ s \f$ is non-self-intersecting. The in
 
 The surface mesh will not have edges incident to only one triangle or holes, loops of such edges, and the triangles are all oriented away from the point set. If the point set has <em>holes</em>, it is likely that the surface mesh will contain overlapping triangles with opposite orientation touching this hole.
 
-An additional treatment can be applied to force the output surface to be 2-manifold: small flat volumes are found before reconstructing and the surface is forced to only use one side of the volume while keeping consistency with the adjacent singular facets. Only one side of each singular facet is used. In addition, non-manifold edges and vertices are removed as a post-processing. The facets that have been discarded to make the surface 2-manifold are stored and accessible.
+An additional treatment can be applied to force the output surface to be 2-manifold: small flat volumes are found before reconstructing and the surface is forced to only use one side of the volume while keeping consistency with the adjacent singular facets. Only one side of each singular facet is used. In addition, non-manifold edges and vertices are removed as a postprocessing. The facets that have been discarded to make the surface 2-manifold are stored and accessible.
 
 If the object is not densely sampled or has disconnected components, the reconstructed surface may have several disconnected components. The surface is either an unordered collection of triangles, or the same collection sorted per \em shell. A shell is a collection of connected triangles that are locally oriented towards the same side of the surface.
 

Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h

@@ -21,7 +21,7 @@ reverses the action of the other.
 The join and split operations. Left to right: The vertex `v` is split
 into \f$ v_1\f$ and \f$ v_2\f$. The faces \f$ f\f$ and \f$ g\f$ are
 inserted after \f$ f_1\f$ and \f$ f_2\f$, respectively, in the
-counter-clockwise sense. The vertices \f$ v_1\f$, \f$ v_2\f$ and the
+counterclockwise sense. The vertices \f$ v_1\f$, \f$ v_2\f$ and the
 faces \f$ f\f$ and \f$ g\f$ are returned as a `boost::tuple` in that
 order. Right to left: The edge `(f,i)` is collapsed, and thus the
 vertices \f$ v_1\f$ and \f$ v_2\f$ are joined. The vertex `v` is
@@ -60,7 +60,7 @@ Vertex_handle join_vertices(Face_handle f, int i);
 /*!
 Splits the vertex `v` into two vertices `v1` and
 `v2`. The common faces `f` and `g` of `v1` and
-`v2` are created after (in the counter-clockwise sense) the
+`v2` are created after (in the counterclockwise sense) the
 faces `f1` and `f2`. The 4-tuple `(v1,v2,f,g)` is
 returned (see \cgalFigureRef{figsdgdssplitjoin}).
 */

Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h

@@ -206,7 +206,7 @@ returns the sign of the distance of `q` from the Voronoi circle
 of `s1`, `s2`, `s3` (the Voronoi circle of three sites
 `s1`, `s2`, `s3` is a circle co-tangent to all three
 sites, that touches them in that order as we walk on its circumference
-in the counter-clockwise sense).
+in the counterclockwise sense).
 \pre the Voronoi circle of `s1`, `s2`, `s3` must exist.
 
 Must also provide `Sign operator()(Site_2 s1, Site_2 s2, Site_2 q)`, which returns the sign of the distance of

Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h

@@ -78,7 +78,7 @@ segment Voronoi diagram.
 /*!
 A constructor for the point \f$ v \f$ at which the three \f$ L_{\infty} \f$
 bisectors between the three given sites `s1`, `s2` and `s3` intersect
-and the regions of `s1`, `s2` and `s3` appear in the counter-clockwise order
+and the regions of `s1`, `s2` and `s3` appear in the counterclockwise order
 `s1`, `s2`, `s3` around \f$ v\f$.
 
 Point \f$ v \f$ is equidistant
@@ -116,7 +116,7 @@ of `s1`, `s2`, `s3`. The \f$ L_{\infty} \f$ Voronoi square
 of three sites
 `s1`, `s2`, `s3` is an axis-parallel square which is passing through all three
 sites and touches them in the `s1`, `s2`, `s3`
-order as we walk on the square in the counter-clockwise sense.
+order as we walk on the square in the counterclockwise sense.
 The center of the square is at the intersection of the three
 \f$ L_{\infty} \f$ bisectors of the three sites.
 
@@ -256,7 +256,7 @@ Since CGAL segments have also an orientation, we also orient
 For an <I>oriented</I> segment \f$ s \f$, we orient its
 \f$L_{\infty}\f$-perpendicular lines so that the lines'
 orientation is closest to the following orientation:
-the orientation of \f$ s \f$ rotated <I>counter-clockwise</I> by
+the orientation of \f$ s \f$ rotated <I>counterclockwise</I> by
 \f$ \pi/2 \f$.
 
 Let `s` be a segment and `p` a point contained in its interior.

Set_movable_separability_2/doc/Set_movable_separability_2/Set_movable_separability_2.txt

@@ -77,7 +77,7 @@ Chapter_2D_Regularized_Boolean_Set-Operations
 "2D Regularized Boolean Set-Operations" for the precise definition
 of simple polygons. Secondly, any consecutive three vertices cannot be
 collinear. If you suspect that the input polygon may not satisfy the
-latter condition, pre-process the polygon to eliminate this
+latter condition, preprocess the polygon to eliminate this
 ill-condition.
 
 The implementation is based on an algorithm developed by Shamai and

Shape_detection/include/CGAL/Polygon_mesh_processing/region_growing.h

@@ -126,7 +126,7 @@ class One_ring_neighbor_query_with_constraints
       \cgalParamExtra{this parameter and `cosine_of_maximum_angle` are exclusive}
     \cgalParamNEnd
     \cgalParamNBegin{postprocess_regions}
-      \cgalParamDescription{Apply a post-processing step to the output of the region growing algorithm.}
+      \cgalParamDescription{Apply a postprocessing step to the output of the region growing algorithm.}
       \cgalParamType{`bool`}
       \cgalParamDefault{false}
     \cgalParamNEnd
@@ -212,7 +212,7 @@ region_growing_of_planes_on_faces(const PolygonMesh& mesh,
 
   if (choose_parameter(get_parameter(np, internal_np::postprocess_regions), false))
   {
-    // first try for a post-processing: look at regions made of one face and check if a
+    // first try for a postprocessing: look at regions made of one face and check if a
     // larger region contains its 3 vertices and if so assigned it to it.
     typedef typename boost::property_traits<RegionMap>::value_type Id;
     for (std::size_t i=0; i<tmp.size(); ++i)

Shape_regularization/doc/Shape_regularization/Shape_regularization.txt

@@ -253,7 +253,7 @@ only return groups of indices of segments with similar orientations and/or posit
 \subsubsection QP_Regularization_Segments_Simplification Simplifying Segments
 
 After regularizing angles and offsets, simplifying segments with similar properties
-is a common post-processing task. This \cgal component provides an utility function
+is a common postprocessing task. This \cgal component provides an utility function
 `Segments::unique_segments()` that takes a set of input segments, groups them with
 respect to the collinearity property, and then returns for each group of collinear segments
 a segment that best fits this group (see the figure below).

Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_2.h

@@ -70,7 +70,7 @@ For any given input polygon, its offset polygons at a certain distance are compo
 This method returns all such contours in an unspecified order and with no parental relationship
 between them (that is why it is called `construct_offset_contours()` and not `construct_offset_polygons()`).
 
-Those offset contours in the resulting sequence which are oriented counter-clockwise are outer contours
+Those offset contours in the resulting sequence which are oriented counterclockwise are outer contours
 and those oriented clockwise are holes. It is up to the user to match each hole to its parent in order
 to reconstruct the parent-hole relationship of the conceptual output. It is sufficient to test each hole
 against each parent as there won't be a hole inside a hole, a parent inside any other contour,