Updated email

Maintenance/public_release/announcement/mailing-beta.eml

@@ -10,102 +10,94 @@ CGAL version 5.0 Beta 1 is a public testing release. It should provide
 a solid ground to report bugs that need to be tackled before the
 release of the final version of CGAL 5.0 in October.
 
+
+CGAL 5.0 is the first release of CGAL that requires a C++ compiler
+with the support of C++14 or later. The new list of supported
+compilers is:
+
+  -   Visual C++ 14.0 (from Visual Studio 2015 Update 3) or later,
+  -   Gnu g++ 6.3 or later (on Linux or MacOS),
+  -   LLVM Clang version 8.0 or later (on Linux or MacOS), and
+  -   Apple Clang compiler versions 7.0.2 and 10.0.1 (on MacOS).
+
+
 Besides fixes and general enhancement to existing packages, the following
 has changed since CGAL 4.14:
 
 
-### Polygonal Surface Reconstruction (new package)
+Polygonal Surface Reconstruction (new package)
 
 -   This package provides a method for piecewise planar object
-    reconstruction from point clouds.  The method takes as input an
+    reconstruction from point clouds. The method takes as input an
     unordered point set sampled from a piecewise planar object and
     outputs a compact and watertight surface mesh interpolating the
-    input point set.  The method assumes that all necessary major
-    planes are provided (or can be extracted from the input point set
-    using the shape detection method described in Point Set Shape
-    Detection, or any other alternative methods).The method can handle
-    arbitrary piecewise planar objects and is capable of recovering
-    sharp features and is robust to noise and outliers.
-
-
-### dD Geometry Kernel
-
--   New exact kernel `Epeck_d`
-
-
-### 2D Triangulations
-
--   Added range types and functions that return ranges, for example
-    for all vertices, which enables to use C++11 for-loops.
-
--   **Breaking change**: Removed the functions
-    `CGAL::Constrained_triangulation_plus_2::
-    vertices_in_constraint_{begin/end}(Vertex_handle va, Vertex_handle
-    vb) const;`, and
-    `CGAL::Constrained_triangulation_plus_2::remove_constraint((Vertex_handle
-    va, Vertex_handle vb)`, that is a pair of vertex handles is no
-    longer a key for a polyline constraint.  Users must use a version
-    prior to 5.0 if they need this functionality.
-
--   **Breaking change**: Removed the deprecated classes
-    `CGAL::Regular_triangulation_euclidean_traits_2`,
-    `CGAL::Regular_triangulation_filtered_traits_2`.   Users must use
-    a version prior to 5.0 if they need these classes.
-
--   **Breaking change**: The constructor and the `insert()` function
-    of `CGAL::Triangulation_2` which takes a range of points as
-    argument no longer performs a `spatial_sort()` of the points.
-
--   Add constructor and `insert()` function to `CGAL::Triangulation_2`
-    that takes a range of points with info.
-
--   **Breaking change**: The graph traits enabling CGAL's 2D
-    triangulations to be used as a parameter for any graph-based
-    algorithm of CGAL (or boost) have been improved to fully model the
-    `FaceGraph` concept.  In addition, only the finite simplicies
-    (those not incident to the infinite vertex) of the 2D
-    triangulations are now visibile through this scope. The complete
-    triangulation can still be accessed as a graph, by using the graph
-    traits of the underlying triangulation data structure (usually,
-    `CGAL::Triangulation_data_structure_2`).
-
--   Introduced a new face base class,
-    `Triangulation_face_base_with_id_2` which enables storing
-    user-defined integer IDs in the face of any 2D triangulation, a
-    precondition to use some BGL algorithms.
-
-
-### 3D Triangulations
-
--   Added range types and functions that return ranges, for example
-    for all vertices, which enables to use C++11 for-loops.
-
--   **Breaking change**: The constructor and the `insert()` function
-    of `CGAL::Triangulation_3` which takes a range of points as
-    argument no longer performs a `spatial_sort()` of the points.
-
--   Add constructor and `insert()` function to `CGAL::Triangulation_3`
-    that takes a range of points with info.
-
-### Point Set Processing
-
--   **Breaking change**: the old API using iterators and overloads for
-    optional parameters is now removed (it was deprecated since CGAL
-    4.12). The current (and now only) API uses ranges and Named
-    Parameters.
-
-### Shape Detection
-
--   Added a new generic implementation of region growing.
-
--   New region growing can be launched on points in 2D and 3D and on a
-    face graph.
-
--   **Breaking change:** `ShapeDetectionTraits` is renamed to
-    `EfficientRANSACTraits`.
-
--   **Breaking change:** `Shape_detection_3` namespace is renamed to
-    `Shape_detection`.
+    input point set. The method assumes that all necessary major planes
+    are provided (or can be extracted from the input point set using the
+    shape detection method described in Point Set Shape Detection, or
+    any other alternative methods).The method can handle arbitrary
+    piecewise planar objects and is capable of recovering sharp features
+    and is robust to noise and outliers. See also the associated blog
+    entry:
+
+      https://www.cgal.org/2019/08/05/Polygonal_surface_reconstruction/
+
+Shape Detection (major changes)
+
+-   BREAKING CHANGE: The concept ShapeDetectionTraits has been renamed
+    to EfficientRANSACTraits.
+-   BREAKING CHANGE: The Shape_detection_3 namespace has been renamed to
+    Shape_detection.
+-   Added a new, generic implementation of region growing. This enables
+    for example applying region growing to inputs such as 2D and 3D
+    point sets, or models of the FaceGraph concept. Learn more about
+    this new algorithm with this blog entry:
+
+      https://www.cgal.org/2019/07/30/Shape_detection/
+
+
+dD Geometry Kernel
+
+-   A new exact kernel, Epeck_d, is now available.
+
+
+2D and 3D Triangulations
+
+-   BREAKING CHANGE: Several deprecated functions and classes have been
+    removed. See the full list of breaking changes in the release
+    notes.
+
+-   BREAKING CHANGE: Insertion of a range of points (either via
+    constructors or insert() functions) in a CGAL::Triangulation_2 and
+    CGAL::Triangulation_3 no longer performs spatial sorting before
+    insertion. Consequently, the combinatorics of the triangulation
+    will now correspond faithfully to the order of the points within
+    the range. Note that this change only affects the base classes
+    CGAL::Triangulation_[23] and not any derived classes, such as
+    Delaunay_triangulation_[23].
+
+
+Polygon Mesh Processing
+
+-   Introduced a wide range of new functions related to location of
+    queries on a triangle mesh, such as
+    CGAL::Polygon_mesh_processing::locate(Point, Mesh). The location of
+    a point on a triangle mesh is expressed as the pair of a face and
+    the barycentric coordinates of the point in this face, enabling
+    robust manipulation of locations (for example, intersections of two
+    3D segments living within the same face).
+-   Added the mesh smoothing function smooth_mesh(), which can be used
+    to improve the quality of triangle elements based on various
+    geometric characteristics.
+-   Added the shape smoothing function smooth_shape(), which can be used
+    to smooth the surface of a triangle mesh, using the mean curvature
+    flow to perform noise removal.
+
+
+Point Set Processing
+
+-   BREAKING CHANGE: the API using iterators and overloads for optional
+    parameters (deprecated since CGAL 4.12) has been removed. The
+    current (and now only) API uses ranges and Named Parameters.
 
 
 See https://www.cgal.org/2019/09/30/cgal50-beta1/ for a complete list of