The CGAL Open Source Project is pleased to announce the release 4.10 Beta 1
of CGAL, the Computational Geometry Algorithms Library.
CGAL version 4.10 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.10 in May.
Besides fixes and general enhancement to existing packages, the following
has changed since CGAL 4.9:
Installation
- The minimum required version of CMake is now 3.1. All CMake versions up to
3.7 are supported.
Generalized Maps (new package)
- This package implements Generalized Maps in d dimensions. A generalized map
is a data structure enabling to represent an orientable or non orientable
subdivided object by describing all the cells of the subdivision (for
example in 3D vertices, edges, faces, volumes) and all the incidence and
adjacency relationships between these cells. This data structure is the
generalization of the combinatorial maps in order to be able to represent
non orientable objects.
3D Point Set (new package)
- This package provides a flexible data structure CGAL::Point_set_3 that
allows the user to easily handle point sets with an arbitrary number of
attributes (such as normal vectors, colors, labeling, etc.).
Note also that the advanced API of a few CGAL packages have change in an
incompatible way:
- Triangulated Surface Mesh Shortest Paths
- CGAL and the Boost Graph Library (BGL)
- 2D and 3D Linear Geometry Kernel
- 2D Triangulations
- 3D Triangulations
See http://www.cgal.org/2017/04/20/cgal410-beta1/ for a complete list of
changes. Breaking changes are highlighted with a bold "Breaking change".