CGAL 4.6 beta1
20 February 2015
2D Polyline Simplification (new package)
- This package enables to simplify polylines with the guarantee
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.
2D Generalized Barycentric Coordinates (new package)
- This package offers an efficient and robust implementation of
two-dimensional closed-form generalized barycentric coordinates
defined for simple two-dimensional polygons.
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.
Surface Mesh (new package)
- The surface mesh class provided by this package is a data structure
that can be used as halfedge data structure or polyhedral surface. It
is an alternative to the packages
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.
dD Geometry Kernel
- It has been reported that the recently introduced
kernel may not work with Intel C++ Compiler prior to version 15.
Documentation has been updated.
3D Convex Hulls
- Add functions
halfspace_intersection_with_constructions_3 to compute
the intersection of halfspaces defining a closed polyhedron.
- Fix a bug introduced in CGAL 4.5 that can appear while computing
the convex hull of coplanar points.
- Fix a robustness issue in
This traits is used by default with the kernel
Combinatorial Maps and Linear Cell Complex
are_attributes_automatically_managed methods in
CombinatorialMap concept. This allows high level
operations to not update non void attributes during massive calls
of these operations, but only after the end of their executions.
- The class
can handle polylines as constraints.
- As a consequence a
Constraint_id has been introduced
identifier of a constraint.
3D Mesh Generation
- Add member functions
in the class
to export the boundary of a domain or a subdomain.
3D Fast Intersection and Distance Computation
- Add new constructors
AABB_face_graph_triangle_primitive in order to be able to
build primitives one by one.
Fixed a bug in
CGAL::Splitters.h sliding mitdpoint rule,
where degenerated point sets (e.g.,points on segment)
caused the kd-tree to get linear.
Improved performance of
Note that VC 2013 does not
boost::container::deque of Boost 1_55 and does
hence have a workaround which does not have the improvement.
Breaking change: The concept
new function overloads for
max_distance_to_rectangle with an additional reference
Breaking change: The order of the points in the iterator range
[tree.begin(),tree.end()] is not the order of
insertion of the points into the tree. This was not guaranteed before
but might have beeen observed and exploited by users.
to save memory.
Geometric Object Generators
- Add a new function
efficiently generates a random polygon as the convex hull of
uniform random points chosen in a disc.