|
1 | | -Subject: CGAL 4.6 Released, Computational Geometry Algorithms Library |
| 1 | +Subject: CGAL 4.6.2 Released, Computational Geometry Algorithms Library |
2 | 2 | Content-Type: text/plain; charset="utf-8" |
3 | 3 | Body: |
4 | 4 |
|
5 | | -The CGAL Open Source Project is pleased to announce the release 4.6 |
| 5 | +The CGAL Open Source Project is pleased to announce the release 4.6.2 |
6 | 6 | of CGAL, the Computational Geometry Algorithms Library. |
7 | 7 |
|
8 | | -Besides fixes to existing packages, the following has changed since |
9 | | -CGAL 4.5: |
| 8 | +Version 4.6.2 is a bug-fix release for version 4.6. The list of fixed bugs |
| 9 | +can be seen Github: |
10 | 10 |
|
11 | | - o 2D Polyline Simplification (new package) |
| 11 | + - fixed in CGAL-4.6.2: |
12 | 12 |
|
13 | | - This package enables to simplify polylines with the guarantee |
14 | | - that the topology of the polylines does not change. This can be |
15 | | - done for a single polyline as well as for a set of polyline |
16 | | - constraints in a constrained triangulation. The simplification |
17 | | - can be controlled with cost and stop functions. |
| 13 | + https://github.com/CGAL/cgal/issues?q=milestone%3A4.6.2 |
18 | 14 |
|
19 | 15 |
|
20 | | - o 2D Generalized Barycentric Coordinates (new package) |
| 16 | + - fixed earlier in CGAL-4.6.1: |
21 | 17 |
|
22 | | - This package offers an efficient and robust implementation of two- |
23 | | - dimensional closed-form generalized barycentric coordinates defined for |
24 | | - simple two-dimensional polygons. |
| 18 | + https://github.com/CGAL/cgal/issues?q=milestone%3A4.6.1 |
25 | 19 |
|
26 | 20 |
|
27 | | - o Scale-Space Surface Reconstruction (new package) |
28 | | - |
29 | | - This new package provides a class gathering a dedicated smoothing |
30 | | - algorithm and some convenience functions to help the creation of a |
31 | | - surface out of a point set using the 3D Alpha Shapes package. The |
32 | | - particularity of this reconstruction pipeline is that the input point |
33 | | - are in the output and no new points are created. Note that in the |
34 | | - current version, the output is a triangle soup that is not necessarily |
35 | | - a valid (manifold) polyhedral surface. |
36 | | - |
37 | | - |
38 | | - o Surface Mesh (new package) |
39 | | - |
40 | | - The surface mesh class provided by this package is an implementation of |
41 | | - the halfedge data structure allowing to represent polyhedral surfaces. |
42 | | - It is an alternative to the packages CGAL::Polyhedron_3 and |
43 | | - CGAL::HalfedgeDS. |
44 | | - |
45 | | - |
46 | | - o dD Triangulation (new package) |
47 | | - |
48 | | - This new package provides classes for manipulating triangulations in |
49 | | - Euclidean spaces whose dimension can be specified at compile-time or at |
50 | | - run-time. It also provides a class that represents Delaunay |
51 | | - triangulations. |
52 | | - |
53 | | - o 2D Triangulations |
54 | | - |
55 | | - The class Constrained_triangulation_plus_2 now can handle polylines as |
56 | | - constraints. |
57 | | - |
58 | | - |
59 | | - o Spatial Searching |
60 | | - |
61 | | - - Improved performance of Orthogonal_k_neighbor_search. |
62 | | - |
63 | | - - Breaking change: The concept OrthogonalDistance has new function |
64 | | - overloads for min_distance_to_rectangle and max_distance_to_rectangle |
65 | | - with an additional reference parameter std::vector. |
66 | | - |
67 | | - |
68 | | -See http://www.cgal.org/releases.html for a complete list of changes. |
69 | | - |
70 | 21 |
|
71 | 22 | The CGAL project is a collaborative effort to develop a robust, |
72 | 23 | easy-to-use, and efficient C++ software library of geometric data |
|
0 commit comments