github CGAL/cgal v5.3-beta1
CGAL-5.3-beta1

latest releases: v5.6.2, v5.5.5, v6.0.1...
pre-release3 years ago

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.

Don't miss a new cgal release

NewReleases is sending notifications on new releases.