Skip to content
v5.4-beta1
Compare
Choose a tag to compare

CGAL-5.4-beta1

Pre-release
Pre-release

The CGAL Open Source Project is pleased to announce the release 5.4 Beta 1 of CGAL, the Computational Geometry Algorithms Library.

CGAL version 5.4 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 5.4 in January 2022.

Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.3:

General changes

  • Added the cmake target CGAL::CGAL_Basic_viewer to ease the compilation of programs using the basic viewer-based function CGAL::draw(). This target will define the macro and link with CGAL_Qt5 target when linked with it.

  • The kernel providing exact constructions and exact predicates (CGAL::Exact_predicates_exact_constructions_kernel) is now thread-safe. See changes in 2D and 3D Linear Geometry Kernel for more details.

Shape Regularization (new package)

  • This package enables to regularize a set of segments and open or closed contours in 2D and a set of planes in 3D such that all input objects are rotated and aligned with respect to the user-specified conditions. In addition, it provides a global regularization framework that can be adjusted for the user needs and any type of geometric objects.

Weights (new package)

  • This package provides a simple and unified interface to different types of weights. In particular, it groups all weights into three category: analytic weights including all basic weights which can be computed analytically for a query point with respect to its local neighbors in 2D and 3D; barycentric weights, including all weights which can be computed for a query point with respect to the vertices of a planar polygon; and weighting regions, including all weights which are used to balance other weights.

2D Generalized Barycentric Coordinates (major changes)

2D and 3D Linear Geometry Kernel

dD Kernel

  • Most operations on Epeck_d objects are now thread-safe, see 2D and 3D Linear Geometry Kernel for details.

2D Arrangements

  • Breaking Change: The traits function objects Compare_x_at_limit_2 and Compare_x_near_limit_2 are renamed to Compare_x_on_boundary_2 and Compare_x_near_boundary_2, respectively.

  • A new hierarchy of traits concepts has been introduced. It captures all the valid combinations of boundary conditions for the 4 boundary sides of the parameter space. The 4 boundaries are Bottom, Top, Left, and Right. Each boundary side can be either contracted, identified, close, open, or oblivious. Not all possible combinations are valid. If one side is identified then the other must be as well. Two adjacent sides cannot be contracted.

  • A new geometric traits, Arr_geodesic_arc_on_sphere_traits_2 has been introduced. It handles arcs of great circles embedded on the unit sphere.

2D Regularized Boolean Set-Operations

3D Mesh Generation

Polygon Mesh Processing

The Heat Method

  • Breaking change: Added the functor Compute_squared_length_3 providing operator(const Vector_3& v), which computes the squared length of v, to the HeatMethodTraits_3 concept.

Point Set Processing

Shape Detection

  • Added new shapes to the Region Growing algorithm on a point set: circles in 2D, spheres in 3D, and cylinders in 3D.

CGAL and Solvers

  • Added support for the OSQP solver. This solver enables to efficiently compute the convex Quadratic Programming (QP) problems arising in the context of several packages.
v5.3.1
Compare
Choose a tag to compare
v5.2.4
Compare
Choose a tag to compare
v5.3
Compare
Choose a tag to compare

The CGAL Open Source Project is pleased to announce the release 5.3 of CGAL, the Computational Geometry Algorithms Library.

Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.2:

General changes

  • The support for the compiled version of CGAL is dropped. Only the header-only version is supported.

  • On Windows, the type used for Exact_rational, in Epick and indirectly (through Lazy_exact_nt)
    Epeck may now be boost::multiprecision::mpq_rational, as has been the case on other platforms
    for several releases. This depends on various options and is added to a list that includes
    mpq_class, CGAL::Gmpq, leda_rational and CGAL::Quotient<CGAL::MP_Float>.

Quadtrees, Octrees, and Orthtrees (new package)

  • This package implements a tree data structure in which each node encloses a hypercubic section
    of space and each non-leave node has hypercubic children whose edge lengths are half its edge length.
    Such a data structure is known as a quadtree in 2D, an octree in 3D, and is generalized
    as an "orthtree" in higher dimensions.

Triangulations on the Sphere (new package)

  • This package enables the construction and manipulation of Delaunay triangulations on the 2-sphere.
    Triangulations are built incrementally and can be modified by insertion or removal of vertices.
    Point location querying and primitives to build the dual Voronoi diagram are provided.

File Input / Output

  • Point set, polygon soup, and polygon mesh file I/O functions have been harmonized and documented:

A comprehensive list of the supported file formats is available in the Stream_support package here; inversely, the following page can be used to find out which CGAL data structures can be used given a specific file format.

Requirements

  • The CMake minimal version is now 3.14.
  • The GNU compiler g++ versions 6 and 7 are no longer tested. Only version 8.3 or later are supported

2D and 3D Linear Geometry Kernel

  • Added is_translation(), is_scaling(), is_reflection(), and is_rotation() to the classes
    Aff_transformation_2
    and Aff_transformation_3,
    which enable determining if the transformations use a specialized representation internally.

2D Regularized Boolean Set-Operations

Polygon Mesh Processing

  • Added the class CGAL::Polyhedral_envelope,
    providing a way to quickly check if a primitive (point, segment, or triangle)
    is within a polyhedral envelope around a set of triangles. It is based on the work of
    Bolun Wang, Teseo Schneider, Yixin Hu, Marco Attene, and Daniele Panozzo.
    "Exact and efficient polyhedral envelope containment check." (ACM Trans. Graph., 39-4, July 2020).
  • Added more functions in the visitor of the corefinement based methods
    to track all edge creations.

Surface Mesh Topology

Surface Mesh Simplification

  • Added a filtering mechanism so that costly tests get only applied to the next candidate for the edge collapse.
  • Added the class Polyhedral_envelope_filter,
    which enables to perform mesh simplification inside a polyhedral envelope of the input mesh.

2D Polyline Simplification

  • When polylines have common subsequences of vertices, these subsequences may now be simplifified simultaneously.

dD Triangulations

  • Added the function insert_if_in_star()
    to the class CGAL::Regular_triangulation,
    which enables users to insert a point p in a regular triangulation on the condition that p
    appears post-insertion in the star of a user-specified, existing vertex.

2D and 3D Alpha Shapes

  • Breaking change: The following deprecated classes have been removed: Alpha_shape_euclidean_traits_2,
    Weighted_alpha_shape_euclidean_traits_2, Alpha_shape_euclidean_traits_3, and
    Weighted_alpha_shape_euclidean_traits_3. All CGAL kernel can be used directly as models
    of the concepts of the 2D and 3D Alpha Shape packages.

Classification

  • Breaking change: the support for TensorFlow has been dropped; the
    classifier CGAL::TensorFlow::Neural_network_classifier has been removed.
v5.2.3
Compare
Choose a tag to compare
v5.3-beta1
Compare
Choose a tag to compare

CGAL-5.3-beta1

Pre-release
Pre-release

The CGAL Open Source Project is pleased to announce the release 5.3 Beta 1 of CGAL, the Computational Geometry Algorithms Library.

CGAL version 5.3 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 5.3 in July 2021.

Besides fixes and general enhancement to existing packages, the following has changed since CGAL 5.2:

Quadtrees, Octrees, and Orthtrees (new package)

  • This package implements a tree data structure in which each node encloses a hypercubic section
    of space and each non-leave node has hypercubic children whose edge lengths are half its edge length.
    Such a data structure is known as a quadtree in 2D, an octree in 3D, and is generalized
    as an "orthtree" in higher dimensions.

Triangulations on the Sphere (new package)

  • This package enables the construction and manipulation of Delaunay triangulations on the 2-sphere.
    Triangulations are built incrementally and can be modified by insertion or removal of vertices.
    Point location querying and primitives to build the dual Voronoi diagram are provided.

File Input / Output

  • Point set, polygon soup, and polygon mesh file I/O functions have been harmonized and documented:

A comprehensive list of the supported file formats is available in the Stream_support package here; inversely, the following page can be used to find out which CGAL data structures can be used given a specific file format.

Requirements

  • The CMake minimal version is now 3.14.
  • The GNU compiler g++ versions 6 and 7 are no longer tested. Only version 8.3 or later are supported

2D and 3D Linear Geometry Kernel

  • Added is_translation(), is_scaling(), is_reflection(), and is_rotation() to the classes
    Aff_transformation_2
    and Aff_transformation_3,
    which enable determining if the transformations use a specialized representation internally.

2D Regularized Boolean Set-Operations

Polygon Mesh Processing

  • Added the class CGAL::Polyhedral_envelope,
    providing a way to quickly check if a primitive (point, segment, or triangle)
    is within a polyhedral envelope around a set of triangles. It is based on the work of
    Bolun Wang, Teseo Schneider, Yixin Hu, Marco Attene, and Daniele Panozzo.
    "Exact and efficient polyhedral envelope containment check." (ACM Trans. Graph., 39-4, July 2020).
  • Added more functions in the visitor of the corefinement based methods
    to track all edge creations.

Surface Mesh Topology

Surface Mesh Simplification

  • Added a filtering mechanism so that costly tests get only applied to the next candidate for the edge collapse.
  • Added the class Polyhedral_envelope_filter,
    which enables to perform mesh simplification inside a polyhedral envelope of the input mesh.

2D Polyline Simplification

  • When polylines have common subsequences of vertices, these subsequences may now be simplifified simultaneously.

dD Triangulations

  • Added the function insert_if_in_star()
    to the class CGAL::Regular_triangulation,
    which enables users to insert a point p in a regular triangulation on the condition that p
    appears post-insertion in the star of a user-specified, existing vertex.

2D and 3D Alpha Shapes

  • Breaking change: The following deprecated classes have been removed: Alpha_shape_euclidean_traits_2,
    Weighted_alpha_shape_euclidean_traits_2, Alpha_shape_euclidean_traits_3, and
    Weighted_alpha_shape_euclidean_traits_3. All CGAL kernel can be used directly as models
    of the concepts of the 2D and 3D Alpha Shape packages.

Classification

  • Breaking change: the support for TensorFlow has been dropped; the
    classifier CGAL::TensorFlow::Neural_network_classifier has been removed.
v5.2.2
Compare
Choose a tag to compare

CGAL-5.2.2 is a bug-fix release.

See on Github the list of bugs that were solved since CGAL-5.2.1.