Skip to content

Releases: CGAL/cgal

CGAL-5.0

08 Nov 13:36
releases/CGAL-5.0
Compare
Choose a tag to compare

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

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

General changes

  • CGAL 5.0 is the first release of CGAL that requires a C++ compiler
    with the support of C++14 or later. The new list of supported
    compilers is:
    • Visual C++ 14.0 (from Visual Studio 2015 Update 3) or later,
    • Gnu g++ 6.3 or later (on Linux or MacOS),
    • LLVM Clang version 8.0 or later (on Linux or MacOS), and
    • Apple Clang compiler versions 7.0.2 and 10.0.1 (on MacOS).
  • Since CGAL 4.9, CGAL can be used as a header-only library, with
    dependencies. Since CGAL 5.0, that is now the default, unless
    specified differently in the (optional) CMake configuration.
  • The section "Getting Started with CGAL" of the documentation has
    been updated and reorganized.
  • The minimal version of Boost is now 1.57.0.

Polygonal Surface Reconstruction (new package)

  • This package provides a method for piecewise planar object reconstruction from point clouds.
    The method takes as input an unordered point set sampled from a piecewise planar object
    and outputs a compact and watertight surface mesh interpolating the input point set.
    The method assumes that all necessary major planes are provided (or can be extracted from
    the input point set using the shape detection method described in Point Set Shape Detection,
    or any other alternative methods).The method can handle arbitrary piecewise planar objects
    and is capable of recovering sharp features and is robust to noise and outliers. See also
    the associated blog entry.

Shape Detection (major changes)

  • Breaking change: The concept ShapeDetectionTraits has been renamed to EfficientRANSACTraits.
  • Breaking change: The Shape_detection_3 namespace has been renamed to Shape_detection.
  • Added a new, generic implementation of region growing. This enables for example applying region growing to inputs such as 2D and 3D point sets,
    or models of the FaceGraph concept. Learn more about this new algorithm with this blog entry.

dD Geometry Kernel

  • A new exact kernel, Epeck_d, is now available.

2D and 3D Triangulations

  • Breaking change: Several deprecated functions and classes have been
    removed. See the full list of breaking changes in the release
    notes.

  • Breaking change: The constructor and the insert() function of
    CGAL::Triangulation_2 or CGAL::Triangulation_3 which take a range
    of points as argument are now guaranteed to insert the points
    following the order of InputIterator. Note that this change only
    affects the base class CGAL::Triangulation_[23] and not any
    derived class, such as CGAL::Delaunay_triangulation_[23].

Polygon Mesh Processing

  • Introduced a wide range of new functions
    related to location of queries on a triangle mesh,
    such as CGAL::Polygon_mesh_processing::locate(Point, Mesh).
    The location of a point on a triangle mesh is expressed as the pair of a face and the barycentric
    coordinates of the point in this face, enabling robust manipulation of locations
    (for example, intersections of two 3D segments living within the same face).
  • Added the mesh smoothing function smooth_mesh(),
    which can be used to improve the quality of triangle elements based on various geometric characteristics.
  • Added the shape smoothing function smooth_shape(),
    which can be used to smooth the surface of a triangle mesh, using the mean curvature flow to perform noise removal.
    (See also the new entry in the User Manual)

Point Set Processing

  • Breaking change: the API using iterators and overloads for optional parameters (deprecated since
    CGAL 4.12) has been removed. The current (and now only) API uses ranges and Named Parameters.

See https://www.cgal.org/2019/11/08/cgal50/ for a complete list of changes.

CGAL-4.14.2

08 Nov 13:25
releases/CGAL-4.14.2
Compare
Choose a tag to compare

CGAL-4.14.2 is a bug-fix release.

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

CGAL-5.0-beta2

30 Oct 15:22
releases/CGAL-5.0-beta2
Compare
Choose a tag to compare
CGAL-5.0-beta2 Pre-release
Pre-release

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

CGAL version 5.0 Beta 2 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.0 in November.

General changes

  • CGAL 5.0 is the first release of CGAL that requires a C++ compiler
    with the support of C++14 or later. The new list of supported
    compilers is:
    • Visual C++ 14.0 (from Visual Studio 2015 Update 3) or later,
    • Gnu g++ 6.3 or later (on Linux or MacOS),
    • LLVM Clang version 8.0 or later (on Linux or MacOS), and
    • Apple Clang compiler versions 7.0.2 and 10.0.1 (on MacOS).
  • Since CGAL 4.9, CGAL can be used as a header-only library, with
    dependencies. Since CGAL 5.0, that is now the default, unless
    specified differently in the (optional) CMake configuration.
  • The section "Getting Started with CGAL" of the documentation has
    been updated and reorganized.
  • The minimal version of Boost is now 1.57.0.

Polygonal Surface Reconstruction (new package)

  • This package provides a method for piecewise planar object reconstruction from point clouds.
    The method takes as input an unordered point set sampled from a piecewise planar object
    and outputs a compact and watertight surface mesh interpolating the input point set.
    The method assumes that all necessary major planes are provided (or can be extracted from
    the input point set using the shape detection method described in Point Set Shape Detection,
    or any other alternative methods).The method can handle arbitrary piecewise planar objects
    and is capable of recovering sharp features and is robust to noise and outliers. See also
    the associated blog entry.

Shape Detection (major changes)

  • Breaking change: The concept ShapeDetectionTraits has been renamed to EfficientRANSACTraits.
  • Breaking change: The Shape_detection_3 namespace has been renamed to Shape_detection.
  • Added a new, generic implementation of region growing. This enables for example applying region growing to inputs such as 2D and 3D point sets,
    or models of the FaceGraph concept. Learn more about this new algorithm with this blog entry.

dD Geometry Kernel

  • A new exact kernel, Epeck_d, is now available.

2D and 3D Triangulations

  • Breaking change: Several deprecated functions and classes have been
    removed. See the full list of breaking changes in the release
    notes.

  • Breaking change: The constructor and the insert() function of
    CGAL::Triangulation_2 or CGAL::Triangulation_3 which take a range
    of points as argument are now guaranteed to insert the points
    following the order of InputIterator. Note that this change only
    affects the base class CGAL::Triangulation_[23] and not any
    derived class, such as CGAL::Delaunay_triangulation_[23].

Polygon Mesh Processing

  • Introduced a wide range of new functions
    related to location of queries on a triangle mesh,
    such as CGAL::Polygon_mesh_processing::locate(Point, Mesh).
    The location of a point on a triangle mesh is expressed as the pair of a face and the barycentric
    coordinates of the point in this face, enabling robust manipulation of locations
    (for example, intersections of two 3D segments living within the same face).
  • Added the mesh smoothing function smooth_mesh(),
    which can be used to improve the quality of triangle elements based on various geometric characteristics.
  • Added the shape smoothing function smooth_shape(),
    which can be used to smooth the surface of a triangle mesh, using the mean curvature flow to perform noise removal.
    (See also the new entry in the User Manual)

Point Set Processing

  • Breaking change: the API using iterators and overloads for optional parameters (deprecated since
    CGAL 4.12) has been removed. The current (and now only) API uses ranges and Named Parameters.

See https://www.cgal.org/2019/10/31/cgal50-beta2/ for a complete list of changes.

CGAL-4.14.1

30 Sep 13:42
releases/CGAL-4.14.1
Compare
Choose a tag to compare

CGAL-4.14.1 is a bug-fix release.

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

CGAL-4.13.2

30 Sep 13:33
releases/CGAL-4.13.2
3702443
Compare
Choose a tag to compare

CGAL-4.13.2 is a bug-fix release.

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

CGAL-5.0-beta1

30 Sep 13:51
releases/CGAL-5.0-beta1
Compare
Choose a tag to compare
CGAL-5.0-beta1 Pre-release
Pre-release

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

CGAL version 5.0 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.0 in October.

CGAL 5.0 is the first release of CGAL that requires a C++ compiler
with the support of C++14 or later. The new list of supported
compilers is:

  • Visual C++ 14.0 (from Visual Studio 2015 Update 3) or later,
  • Gnu g++ 6.3 or later (on Linux or MacOS),
  • LLVM Clang version 8.0 or later (on Linux or MacOS), and
  • Apple Clang compiler versions 7.0.2 and 10.0.1 (on MacOS).

Since CGAL 4.9, CGAL can be used as a header-only library, with
dependencies. Since CGAL 5.0, that is now the default, unless
specified differently in the (optional) CMake configuration.

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

Polygonal Surface Reconstruction (new package)

  • This package provides a method for piecewise planar object
    reconstruction from point clouds. The method takes as input an
    unordered point set sampled from a piecewise planar object and
    outputs a compact and watertight surface mesh interpolating the
    input point set. The method assumes that all necessary major planes
    are provided (or can be extracted from the input point set using the
    shape detection method described in Point Set Shape Detection, or
    any other alternative methods).The method can handle arbitrary
    piecewise planar objects and is capable of recovering sharp features
    and is robust to noise and outliers. See also the associated blog
    entry:

    https://www.cgal.org/2019/08/05/Polygonal_surface_reconstruction/

Shape Detection (major changes)

  • BREAKING CHANGE: The concept ShapeDetectionTraits has been renamed
    to EfficientRANSACTraits.

  • BREAKING CHANGE: The Shape_detection_3 namespace has been renamed to
    Shape_detection.

  • Added a new, generic implementation of region growing. This enables
    for example applying region growing to inputs such as 2D and 3D
    point sets, or models of the FaceGraph concept. Learn more about
    this new algorithm with this blog entry:

    https://www.cgal.org/2019/07/30/Shape_detection/

dD Geometry Kernel

  • A new exact kernel, Epeck_d, is now available.

2D and 3D Triangulations

  • BREAKING CHANGE: Several deprecated functions and classes have been
    removed. See the full list of breaking changes in the release
    notes.

  • BREAKING CHANGE: The constructor and the insert() function of
    CGAL::Triangulation_2 or CGAL::Triangulation_3 which take a range
    of points as argument are now guaranteed to insert the points
    following the order of InputIterator. Note that this change only
    affects the base class CGAL::Triangulation_[23] and not any
    derived class, such as CGAL::Delaunay_triangulation_[23].

Polygon Mesh Processing

  • Introduced a wide range of new functions related to location of
    queries on a triangle mesh, such as
    CGAL::Polygon_mesh_processing::locate(Point, Mesh). The location of
    a point on a triangle mesh is expressed as the pair of a face and
    the barycentric coordinates of the point in this face, enabling
    robust manipulation of locations (for example, intersections of two
    3D segments living within the same face).
  • Added the mesh smoothing function smooth_mesh(), which can be used
    to improve the quality of triangle elements based on various
    geometric characteristics.
  • Added the shape smoothing function smooth_shape(), which can be used
    to smooth the surface of a triangle mesh, using the mean curvature
    flow to perform noise removal.

Point Set Processing

  • BREAKING CHANGE: the API using iterators and overloads for optional
    parameters (deprecated since CGAL 4.12) has been removed. The
    current (and now only) API uses ranges and Named Parameters.

See https://www.cgal.org/2019/09/30/cgal50-beta1/ for a complete list of
changes.

CGAL-4.13.1

05 Apr 12:52
releases/CGAL-4.13.1
Compare
Choose a tag to compare

CGAL-4.13.1 is a bug-fix release.

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

CGAL-4.12.2

05 Apr 12:44
releases/CGAL-4.12.2
Compare
Choose a tag to compare

CGAL-4.12.2 is a bug-fix release.

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

CGAL-4.14

29 Mar 15:19
releases/CGAL-4.14
Compare
Choose a tag to compare

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

This release will be the last one supporting C++98/C++03 compilers, and the next release, CGAL version 5.0, will require support for C++14.

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

2D Periodic Hyperbolic Triangulations (new package)

  • This package allows the computation of Delaunay triangulations of the Bolza surface. The Bolza surface is the most symmetric hyperbolic surface of genus 2. Its fundamental domain is the regular hyperbolic octagon with angles π/4 centered at the origin of the Poincaré disk. Triangulations of the Bolza surface can be seen as triangulations of the hyperbolic plane that are periodic in the four directions defined by the sides of this regular octagon.

2D Hyperbolic Triangulations (new package)

  • This package allows the computation of Delaunay Triangulations of sets of points in the Poincaré disk, which is one of the conformal models for the hyperbolic plane.

The Heat Method (new package)

  • This package provides an algorithm that solves the single- or multiple-source shortest path problem by returning an approximation of the geodesic distance for all vertices of a triangle mesh to the closest vertex in a given set of source vertices.

Triangulated Surface Mesh Approximation (new package)

  • This package implements the Variational Shape Approximation method to approximate an input surface triangle mesh by a simpler surface triangle mesh.

See https://www.cgal.org/2019/03/29/cgal414/ for a complete list of changes.

CGAL-4.14-beta4

28 Mar 13:08
releases/CGAL-4.14-beta4
Compare
Choose a tag to compare
CGAL-4.14-beta4 Pre-release
Pre-release
releases/CGAL-4.14-beta4

Tag CGAL-4.14-beta4