Push the announcement mail

Maintenance/public_release/announcement/mailing-beta.eml

@@ -1,34 +1,53 @@
-Subject: CGAL 4.9 Beta 1 Released, Computational Geometry Algorithms Library
+Subject: CGAL 4.10 Beta 1 Released, Computational Geometry Algorithms Library
 Content-Type: text/plain; charset="utf-8"
 Body: 
 
-The CGAL Open Source Project is pleased to announce the release 4.9 Beta 1
+The CGAL Open Source Project is pleased to announce the release 4.10 Beta 1
 of CGAL, the Computational Geometry Algorithms Library.
 
-CGAL version 4.9 Beta 1 is a public testing release. It should provide
+CGAL version 4.10 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 4.9 in September.
+release of the final version of CGAL 4.10 in May.
 
 
 Besides fixes and general enhancement to existing packages, the following
-has changed since CGAL 4.8:
-
-  o General
-
-    - CGAL can now be used in headers only mode, i.e. without compiling the
-      CGAL libraries and linking with these libraries when compiling
-      examples, tests and demos. Note that running CMake on CGAL is still
-      required in order to generate some configuration files.
+has changed since CGAL 4.9:
 
 
-  o Cone Based Spanners (new package)
+* Installation
 
-    - This package provides algorithms for constructing two kinds of
-      cone-based spanners: Yao graph and Theta graph, given a set of
-      vertices on the plane and the directions of cone boundaries.
+  - The minimum required version of CMake is now 3.1. All CMake versions up to
+    3.7 are supported.
 
 
-See http://www.cgal.org/releases.html for a complete list of changes.
+* Generalized Maps (new package)
+
+  - This package implements Generalized Maps in d dimensions. A generalized map
+    is a data structure enabling to represent an orientable or non orientable
+    subdivided object by describing all the cells of the subdivision (for
+    example in 3D vertices, edges, faces, volumes) and all the incidence and
+    adjacency relationships between these cells. This data structure is the
+    generalization of the combinatorial maps in order to be able to represent
+    non orientable objects.
+
+
+* 3D Point Set (new package)
+
+  - This package provides a flexible data structure CGAL::Point_set_3 that
+    allows the user to easily handle point sets with an arbitrary number of
+    attributes (such as normal vectors, colors, labeling, etc.).
+
+
+Note also that the advanced API of a few CGAL packages have change in an
+incompatible way:
+- Triangulated Surface Mesh Shortest Paths
+- CGAL and the Boost Graph Library (BGL)
+- 2D and 3D Linear Geometry Kernel
+- 2D Triangulations
+- 3D Triangulations
+
+See http://www.cgal.org/2017/04/20/cgal410-beta1/ for a complete list of
+changes. Breaking changes are highlighted with a bold "Breaking change".
 
 
 The CGAL project is a collaborative effort to develop a robust,