Announcement for CGAL-3.6 (final release): add a paragraph about periodic

triangulations and alpha shapes.

.gitattributes

@@ -1667,6 +1667,7 @@ Maintenance/public_release/announcement/CGAL-3.4Beta -text
 Maintenance/public_release/announcement/CGAL-3.5 -text
 Maintenance/public_release/announcement/CGAL-3.5-beta1 -text
 Maintenance/public_release/announcement/CGAL-3.5.1 -text
+Maintenance/public_release/announcement/CGAL-3.6 -text
 Maintenance/public_release/announcement/CGAL-3.6-beta1 -text
 Maintenance/release_building/BUGFIX_NUMBER -text
 Maintenance/release_building/MAJOR_NUMBER -text

Maintenance/public_release/announcement/CGAL-3.6

@@ -0,0 +1,69 @@
+Subject: CGAL 3.6 Released, Computational Geometry Algorithms Library
+Body:
+
+The CGAL Open Source Project is pleased to announce the Release 3.6
+of CGAL, the Computational Geometry Algorithms Library.
+
+
+Besides improvements and fixes to existing packages, this release offers
+the following new features.
+
+ o 3D Periodic Triangulations
+
+    The package can now be used with the 3D Alpha Shapes package to compute 
+    periodic alpha shapes. 
+
+ o 3D Mesh Generation
+
+    The mesh generator has been enriched with an optimization phase to
+    provide 3D meshes with well shaped tetrahedra (and in particular no
+    slivers).
+
+ o Algebraic Kernel (new package)
+
+    This new package provides implementations of algorithms to determine,
+    compare and approximate real roots of univariate polynomials and
+    bivariate polynomial systems.
+
+See http://www.cgal.org/releases.html for a complete list of changes.
+
+
+The CGAL project is a collaborative effort to develop a robust,
+easy-to-use, and efficient C++ software library of geometric data
+structures and algorithms, like
+- triangulations (2D constrained triangulations and Delaunay
+  triangulations in 2D and 3D),
+- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
+  Voronoi diagrams, and segment Voronoi diagrams),
+- Boolean operations on polygons and polyhedra,
+- Regularized Boolean operations on polygons with curved arcs
+- arrangements of curves,
+- mesh algorithms (2D Delaunay mesh generation and 3D surface mesh
+  generation, surface mesh subdivision and parameterization),
+- alpha shapes (in 2D and 3D),
+- convex hull algorithms (in 2D, 3D and dD),
+- operations on polygons (straight skeleton and offset polygon),
+- search structures (kd trees for nearest neighbor search, and
+  range and segment trees),
+- interpolation (natural neighbor interpolation and placement of
+  streamlines),
+- optimization algorithms (smallest enclosing sphere of points or
+  spheres, smallest enclosing ellipsoid of points, principal
+  component analysis),
+- kinetic data structures
+
+
+
+
+Some modules are distributed under the terms of the LGPL Open Source
+license (GNU Lesser General Public License v2.1).
+Most modules are distributed under the terms of the QPL Open Source
+license (Q Public License v1.0).
+If your intended usage does not meet the criteria of the
+aforementioned licenses, a commercial license can be purchased from
+GeometryFactory (http://www.geometryfactory.com/).
+
+
+For further information and for downloading the library and its
+documentation, please visit the CGAL web site: http://www.cgal.org/
+