songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'releases/CGAL-4.6-branch' 

Conflicts:
	Maintenance/public_release/announcement/mailing.eml
This commit is contained in:
Laurent Rineau 2015-08-20 12:08:18 +02:00
parent 9e9126ef73 667f7108cf
commit af54a3b145
1 changed files with 8 additions and 57 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

65
Maintenance/public_release/announcement/mailing.eml
View File

@ -1,73 +1,24 @@
Subject: CGAL 4.6 Released, Computational Geometry Algorithms Library Subject: CGAL 4.6.2 Released, Computational Geometry Algorithms Library
From: Laurent Rineau <laurent.rineau@cgal.org> From: Laurent Rineau <laurent.rineau@cgal.org>
Content-Type: text/plain; charset="utf-8" Content-Type: text/plain; charset="utf-8"
Body: Body:
The CGAL Open Source Project is pleased to announce the release 4.6 The CGAL Open Source Project is pleased to announce the release 4.6.2
of CGAL, the Computational Geometry Algorithms Library. of CGAL, the Computational Geometry Algorithms Library.
Besides fixes to existing packages, the following has changed since Version 4.6.2 is a bug-fix release for version 4.6. The list of fixed bugs
CGAL 4.5: can be seen Github:
o 2D Polyline Simplification (new package) - fixed in CGAL-4.6.2:
This package enables to simplify polylines with the guarantee https://github.com/CGAL/cgal/issues?q=milestone%3A4.6.2
that the topology of the polylines does not change. This can be
done for a single polyline as well as for a set of polyline
constraints in a constrained triangulation. The simplification
can be controlled with cost and stop functions.
o 2D Generalized Barycentric Coordinates (new package) - fixed earlier in CGAL-4.6.1:
This package offers an efficient and robust implementation of two- https://github.com/CGAL/cgal/issues?q=milestone%3A4.6.1
dimensional closed-form generalized barycentric coordinates defined for
simple two-dimensional polygons.
o Scale-Space Surface Reconstruction (new package)
This new package provides a class gathering a dedicated smoothing
algorithm and some convenience functions to help the creation of a
surface out of a point set using the 3D Alpha Shapes package. The
particularity of this reconstruction pipeline is that the input point
are in the output and no new points are created. Note that in the
current version, the output is a triangle soup that is not necessarily
a valid (manifold) polyhedral surface.
o Surface Mesh (new package)
The surface mesh class provided by this package is an implementation of
the halfedge data structure allowing to represent polyhedral surfaces.
It is an alternative to the packages CGAL::Polyhedron_3 and
CGAL::HalfedgeDS.
o dD Triangulation (new package)
This new package provides classes for manipulating triangulations in
Euclidean spaces whose dimension can be specified at compile-time or at
run-time. It also provides a class that represents Delaunay
triangulations.
o 2D Triangulations
The class Constrained_triangulation_plus_2 now can handle polylines as
constraints.
o Spatial Searching
- Improved performance of Orthogonal_k_neighbor_search.
- Breaking change: The concept OrthogonalDistance has new function
overloads for min_distance_to_rectangle and max_distance_to_rectangle
with an additional reference parameter std::vector.
See http://www.cgal.org/releases.html for a complete list of changes.
The CGAL project is a collaborative effort to develop a robust, The CGAL project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data easy-to-use, and efficient C++ software library of geometric data