Link to the
Download link for CGAL-4.9
CGAL can now be used in headers only mode, i.e. without compiling the
CGAL libraries and linking with these libraries when compiling
examples, tests and demos. Note that running CMake on CGAL is still
required in order to generate some configuration files.
Cone Based Spanners (new package)
This package provides algorithms for constructing two kinds of
cone-based spanners: Yao graph and Theta graph, given a set of
vertices on the plane and the directions of cone boundaries.
2D Minkowski Sums
- Introduce a convex decomposition strategy,
Polygon_nop_decomposition_2, that merely passed the
input polygon to the list of output polygons.
- Introduce overloads of the function
which accepts 2 decomposition strategies.
- Introduce an overloaded function
minkowski_sum_by_decomposition_2(P, Q, decom_no_holes,
decomp_with_holes), which computes the 2D Minkowski sum using
optimal choices of decomposition strategies.
Deprecate global functions
remove_cell()) which are now member functions in
- It is not longer possible to use the old API switched on by
defining the macro
This API was deprecated since CGAL 4.4.
Point Set Processing
- New function
allows the user to read any additional point attribute from a PLY
input point set.
Point Set Shape Detection
- New post-processing
CGAL::regularize_planes(). This allows the
user to favor parallelism, orthogonality, coplanarity and/or axial
symmetry between detected planes.
Polygon Mesh Processing
- Add the function
to check whether a polygon soup is a polygon mesh.
- Add some new features to
It is now possible to select fixed vertices that survive the
remeshing process, and to keep face attributes such as colors
valid after remeshing.
The user can choose the number of relaxation steps happening at
each loop, and to run 1-dimensional relaxation along constrained
now indicate whether some faces have not been triangulated.
Surface Mesh Deformation
- Add a new tag
SRE_ARAP to use the Smoothed Rotation
Enhanced As-Rigid-As-Possible deformation algorithm.
3D Fast Intersection and Distance Computation
- Add the functions
AABB_tree::first_intersected_primitive() that compute
the intersection which is closest to the source of a ray
CGAL and the Boost Graph Library (BGL)
Add a helper function
copy a source FaceListGraph into another FaceListGraph of
Add a class
CGAL::Dual that creates the dual view of
FaceGraph and a creation
CGAL and Boost Property Maps
- It is not longer possible to use the old API of the property maps
provided by CGAL, switched on by defining the macro
CGAL_USE_PROPERTY_MAPS_API_V1. This API was deprecated
since CGAL 4.3.