mirror of https://github.com/CGAL/cgal
First version of the CGAL-4.3-beta1 announcement mail
This commit is contained in:
parent
7148772199
commit
33b9b9331b
|
|
@ -1,30 +1,35 @@
|
|||
Subject: CGAL 4.2 Beta 1 Released, Computational Geometry Algorithms Library
|
||||
Subject: CGAL 4.3 Beta 1 Released, Computational Geometry Algorithms Library
|
||||
Body:
|
||||
|
||||
The CGAL Open Source Project is pleased to announce the release 4.2 Beta 1
|
||||
The CGAL Open Source Project is pleased to announce the release 4.3 Beta 1
|
||||
of CGAL, the Computational Geometry Algorithms Library.
|
||||
|
||||
CGAL version 4.2 Beta 1 is a public testing release. It should provide
|
||||
CGAL version 4.3 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.2 at the end of March.
|
||||
release of the final version of CGAL 4.3 mid-September.
|
||||
|
||||
|
||||
Besides fixes to existing packages, the following has changed since
|
||||
CGAL 4.1:
|
||||
|
||||
o New compiler support
|
||||
|
||||
Microsoft Windows Visual C++ compiler 2012 (VC11) is now supported.
|
||||
|
||||
CGAL 4.2:
|
||||
|
||||
o The CGAL Manual generated with Doxygen
|
||||
|
||||
The CGAL project publishes a beta version of the CGAL manual generated
|
||||
with Doxygen: http://doc.cgal.org/4.2/
|
||||
The documentation of CGAL is now generated with Doxygen:
|
||||
http://doc.cgal.org/4.3/
|
||||
|
||||
In future versions of CGAL, the manual generated with Doxygen is planned
|
||||
to replace the manual that is currently published at
|
||||
http://www.cgal.org/Manual/latest/
|
||||
The conversion to Doxygen from our home-made tools was not completely
|
||||
smooth. Please report any documentation bug you may discover to the
|
||||
Inria Forge bug tracker:
|
||||
https://gforge.inria.fr/tracker/?atid=13845&group_id=52&func=browse
|
||||
|
||||
o 2D Periodic Triangulations (new package)
|
||||
|
||||
This package allows to build and handle triangulations of point sets in
|
||||
the two dimensional flat torus. Triangulations are built incrementally
|
||||
and can be modified by insertion or removal of vertices. They offer
|
||||
point location facilities. The package provides Delaunay triangulations
|
||||
and offers nearest neighbor queries and primitives to build the dual
|
||||
Voronoi diagrams.
|
||||
|
||||
|
||||
See http://www.cgal.org/releases.html for a complete list of changes.
|
||||
|
|
|
|||
Loading…
Reference in New Issue