mirror of https://github.com/CGAL/cgal
Proposal for announcement of CGAL-4.4-beta1
This commit is contained in:
parent
93c9570f33
commit
0d538e167c
|
|
@ -1,35 +1,23 @@
|
||||||
Subject: CGAL 4.3 Beta 1 Released, Computational Geometry Algorithms Library
|
Subject: CGAL 4.4 Beta 1 Released, Computational Geometry Algorithms Library
|
||||||
Body:
|
Body:
|
||||||
|
|
||||||
The CGAL Open Source Project is pleased to announce the release 4.3 Beta 1
|
The CGAL Open Source Project is pleased to announce the release 4.4 Beta 1
|
||||||
of CGAL, the Computational Geometry Algorithms Library.
|
of CGAL, the Computational Geometry Algorithms Library.
|
||||||
|
|
||||||
CGAL version 4.3 Beta 1 is a public testing release. It should provide
|
CGAL version 4.4 Beta 1 is a public testing release. It should provide
|
||||||
a solid ground to report bugs that need to be tackled before the
|
a solid ground to report bugs that need to be tackled before the
|
||||||
release of the final version of CGAL 4.3 mid-September.
|
release of the final version of CGAL 4.4 mid-March.
|
||||||
|
|
||||||
|
|
||||||
Besides fixes to existing packages, the following has changed since
|
Besides fixes to existing packages, the following has changed since
|
||||||
CGAL 4.2:
|
CGAL 4.3:
|
||||||
|
|
||||||
o The CGAL Manual generated with Doxygen
|
o Triangulated Surface Mesh Segmentation (new package)
|
||||||
|
|
||||||
The documentation of CGAL is now generated with Doxygen:
|
This package implements the segmentation of triangulated surface meshes
|
||||||
http://doc.cgal.org/4.3/
|
based on the Shape Diameter Function (SDF). In addition, it also provides
|
||||||
|
functions to generate segmentations based on a user defined alternative to
|
||||||
The conversion to Doxygen from our home-made tools was not completely
|
the SDF.
|
||||||
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.
|
See http://www.cgal.org/releases.html for a complete list of changes.
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue