Skip to content

Releases: CGAL/cgal

CGAL-4.11.1

26 Feb 15:25
releases/CGAL-4.11.1

Choose a tag to compare

CGAL-4.11.1 is a bug-fix release.

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

CGAL-4.12-beta1

27 Feb 15:35
releases/CGAL-4.12-beta1

Choose a tag to compare

CGAL-4.12-beta1 Pre-release
Pre-release

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

CGAL version 4.12 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 4.12 in September.

Important Notice

  • The CMake scripts used by CGAL have been changed to use modern patterns
    introduced by CMake 2.8.12 and CMake 3.0: instead of setting CMake
    variables, the script now defines imported targets and uses link
    interfaces.

    That is mostly backward-compatible with existing usages of CGAL CMake
    scripts. The only non-compatible effect is that the CMAKE_BUILD_TYPE
    and compilation flags are no longer copied from the CGAL_DIR to the
    project using it. Note also that the CMAKE_BUILD_TYPE is no longer
    set to Release by default. For a developer using the Visual Studio
    IDE or the Xcode IDE, the change should be transparent. Developers using
    makefiles or the Ninja build-system should set the CMAKE_BUILD_TYPE
    to Release manually, to avoid using CGAL libraries without any
    compile-time optimization.

2D Movable Separability of Sets (new package)

  • A new package called "2D Movable Separability of Sets" has been
    introduced. It handles a class of problems that deal with moving
    sets of objects in the plane; the challenge is to avoid collisions
    between the objects while considering different kinds of motions and
    various definitions of separation.

    At this point this package consists of the implementations of
    various predicates and constructions related to castings of
    polygonal objects. In particular, it can be used to determine
    whether a feasible mold for a polygonal object does exist. If a mold
    exists, the package can also be used to compute all possible
    orientations of the feasible molds and the corresponding motions
    needed to remove the casted object from the mold.

Classification (new package)

  • This package offers an algorithm that classifies a data set into a
    user-defined set of labels (such as ground, vegetation, buildings,
    etc.). A flexible API is provided so that users can classify any
    type of data, compute their own local features on the input data
    set, and define their own labels.

Kinetic Data Structures (removed package)

  • This package has been removed from CGAL-4.12. Users of the package
    will have to keep using the source code available in CGAL-4.11 or
    earlier.

See the full changelog for a complete list of changes.

CGAL-4.10.2

16 Jan 14:11
releases/CGAL-4.10.2
0cd89c4

Choose a tag to compare

CGAL-4.10.2 is a bug-fix release.

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

CGAL-4.11

21 Sep 10:25
releases/CGAL-4.11

Choose a tag to compare

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

This release is pretty special by its number of breaking changes in the
API. In order to have a better feature set, or a better API, several
packages have been reworked in a way that breaks the back-compatibility
with the previous versions of the API.

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

3D Periodic Regular Triangulations (new feature)

  • Added the class Periodic_3_regular_triangulation_3, which provides
    functionality for 3D periodic weighted Delaunay triangulations. The
    construction is fully dynamic: it provides both point insertion and
    vertex removal.

dD Regular Triangulations (new feature)

  • Added the class Regular_triangulation, which provides functionality for
    dD weighted Delaunay triangulations. Note that the removal of points is
    not yet supported.

2D and 3D Linear Geometry Kernel (breaking change)

  • Breaking change: The dangerous implicit conversions between weighted
    points and points in the concept Kernel have been
    disabled. Constructors offering to build a weighted point from a point
    (and reversely) are still requested by the concept Kernel but must now
    be marked with the explicit specifier.

  • Breaking change: The removal of implicit conversions between points and
    weighted points in the concept Kernel has incidentally created various
    minor breaking changes in the following packages: 2D Alpha Shapes, 2D
    and 3D Triangulations, and 3D Mesh Generation. See the full changelog
    for details.

Triangulated Surface Mesh Parameterization (breaking change)

  • Breaking change: The package has been rewritten and can operate on any
    model of the MutableFaceGraph concept. All previous parameterization
    methods are still offered, although with a different, simpler API. The
    documentation has been updated and offers a gentle introduction to the
    new API. Users who wish to use the former API must use a version prior
    to 4.11.

  • Breaking change: The adapter to add virtual seams is now the class
    CGAL::Seam_mesh in the package CGAL and the BGL.

  • Breaking change: The package has been restructured and most headers
    have been moved. In a general manner, users should replace <CGAL/XXX.h>
    with <CGAL/Surface_mesh_parameterization/XXX.h>

  • Add the As Rigid As Possible Parameterization method. This
    parameterization allows the user to prioritize angle preservation,
    shape preservation, or a balance of both.

  • Add the Orbifold Tutte Embedding method. This parameterization method
    allows to parameterize meshes that are topological spheres.

3D Surface Subdivision Methods (breaking changes)

  • The subdivision algorithms now work on any model of a
    MutableFaceGraph. A new API to the subdivision methods is offered,
    which uses optional named parameters to pass the number of iterations
    and a vertex property map.

  • Breaking change: Removed the headers <CGAL/Subdivision_method_3.h> and
    <CGAL/Subdivision_mask_3.h>. The headers <CGAL/Subdivision_method_3/ subdivision_methods_3.h> and <CGAL/Subdivision_method_3/ subdivision_masks_3.h> should respectively be used instead.

  • Sqrt3 subdivision can now handle input surfaces with a border.

Scale-Space Surface Reconstruction (breaking change)

  • Breaking change: the API was rewritten to separate the smoothing and
    meshing algorithm and making it possible for the user to use different
    ones. The default algorithms used are the same as before this API
    change, but methods are moved to the classes Weighted_PCA_smoother and
    Alpha_shape_mesher.

  • Alternative smoothing and meshing methods are provided: Jet_smoother
    and Advancing_front_mesher.

See the full changelog for a complete list of changes.

CGAL-4.10.1

13 Sep 08:39
releases/CGAL-4.10.1

Choose a tag to compare

CGAL-4.10.1 is a bug-fix release.

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

CGAL-4.11-beta1

01 Aug 14:00
releases/CGAL-4.11-beta1

Choose a tag to compare

CGAL-4.11-beta1 Pre-release
Pre-release

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

CGAL version 4.11 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 4.11 in September.

This release is pretty special by its number of breaking changes in the
API. In order to have a better feature set, or a better API, several
packages have been reworked in a way that breaks the back-compatibility
with the previous versions of the API.

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

3D Periodic Regular Triangulations (new feature)

  • Added the class Periodic_3_regular_triangulation_3, which provides
    functionality for 3D periodic weighted Delaunay triangulations. The
    construction is fully dynamic: it provides both point insertion and
    vertex removal.

dD Regular Triangulations (new feature)

  • Added the class Regular_triangulation, which provides functionality for
    dD weighted Delaunay triangulations. Note that the removal of points is
    not yet supported.

2D and 3D Linear Geometry Kernel (breaking change)

  • Breaking change: The dangerous implicit conversions between weighted
    points and points in the concept Kernel have been
    disabled. Constructors offering to build a weighted point from a point
    (and reversely) are still requested by the concept Kernel but must now
    be marked with the explicit specifier.

  • Breaking change: The removal of implicit conversions between points and
    weighted points in the concept Kernel has incidentally created various
    minor breaking changes in the following packages: 2D Alpha Shapes, 2D
    and 3D Triangulations, and 3D Mesh Generation. See the full changelog
    for details.

Triangulated Surface Mesh Parameterization (breaking change)

  • Breaking change: The package has been rewritten and can operate on any
    model of the MutableFaceGraph concept. All previous parameterization
    methods are still offered, although with a different, simpler API. The
    documentation has been updated and offers a gentle introduction to the
    new API. Users who wish to use the former API must use a version prior
    to 4.11.

  • Breaking change: The adapter to add virtual seams is now the class
    CGAL::Seam_mesh in the package CGAL and the BGL.

  • Breaking change: The package has been restructured and most headers
    have been moved. In a general manner, users should replace <CGAL/XXX.h>
    with <CGAL/Surface_mesh_parameterization/XXX.h>.

  • Add the As Rigid As Possible Parameterization method. This
    parameterization allows the user to prioritize angle preservation,
    shape preservation, or a balance of both.

  • Add the Orbifold Tutte Embedding method. This parameterization method
    allows to parameterize meshes that are topological spheres.

3D Surface Subdivision Methods (breaking changes)

  • The subdivision algorithms now work on any model of a
    MutableFaceGraph. A new API to the subdivision methods is offered,
    which uses optional named parameters to pass the number of iterations
    and a vertex property map.

  • Breaking change: Removed the headers <CGAL/Subdivision_method_3.h> and
    <CGAL/Subdivision_mask_3.h>. The headers <CGAL/Subdivision_method_3/ subdivision_methods_3.h> and <CGAL/Subdivision_method_3/ subdivision_masks_3.h> should respectively be used instead.

  • Sqrt3 subdivision can now handle input surfaces with a border.

Scale-Space Surface Reconstruction (breaking change)

  • Breaking change: the API was rewritten to separate the smoothing and
    meshing algorithm and making it possible for the user to use different
    ones. The default algorithms used are the same as before this API
    change, but methods are moved to the classes Weighted_PCA_smoother and
    Alpha_shape_mesher.

  • Alternative smoothing and meshing methods are provided: Jet_smoother
    and Advancing_front_mesher.

See the full changelog for a complete list of changes.

CGAL-4.10

29 May 14:58
releases/CGAL-4.10

Choose a tag to compare

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

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

Installation

  • The minimum required version of CMake is now 3.1. All CMake versions up to
    3.7 are supported.

Generalized Maps (new package)

  • This package implements Generalized Maps in d dimensions. A generalized map
    is a data structure enabling to represent an orientable or non orientable
    subdivided object by describing all the cells of the subdivision (for
    example in 3D vertices, edges, faces, volumes) and all the incidence and
    adjacency relationships between these cells. This data structure is the
    generalization of the combinatorial maps in order to be able to represent
    non orientable objects.

3D Point Set (new package)

  • This package provides a flexible data structure CGAL::Point_set_3 that
    allows the user to easily handle point sets with an arbitrary number of
    attributes (such as normal vectors, colors, labeling, etc.).

Note also that the advanced API of a few CGAL packages have change in an
incompatible way:

  • Triangulated Surface Mesh Shortest Paths
  • CGAL and the Boost Graph Library (BGL)
  • 2D and 3D Linear Geometry Kernel
  • 2D Triangulations
  • 3D Triangulations

See http://www.cgal.org/2017/05/29/cgal410/ for a complete list of
changes. Breaking changes are highlighted with a bold "Breaking change".

CGAL-4.10-beta1

20 Apr 14:26
releases/CGAL-4.10-beta1

Choose a tag to compare

CGAL-4.10-beta1 Pre-release
Pre-release

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

CGAL version 4.10 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 4.10 in May.

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

Installation

  • The minimum required version of CMake is now 3.1. All CMake versions up to
    3.7 are supported.

Generalized Maps (new package)

  • This package implements Generalized Maps in d dimensions. A generalized map
    is a data structure enabling to represent an orientable or non orientable
    subdivided object by describing all the cells of the subdivision (for
    example in 3D vertices, edges, faces, volumes) and all the incidence and
    adjacency relationships between these cells. This data structure is the
    generalization of the combinatorial maps in order to be able to represent
    non orientable objects.

3D Point Set (new package)

  • This package provides a flexible data structure CGAL::Point_set_3 that
    allows the user to easily handle point sets with an arbitrary number of
    attributes (such as normal vectors, colors, labeling, etc.).

Note also that the advanced API of a few CGAL packages have change in an
incompatible way:

  • Triangulated Surface Mesh Shortest Paths
  • CGAL and the Boost Graph Library (BGL)
  • 2D and 3D Linear Geometry Kernel
  • 2D Triangulations
  • 3D Triangulations

See http://www.cgal.org/2017/04/20/cgal410-beta1/ for a complete list of
changes. Breaking changes are highlighted with a bold "Breaking change".

CGAL 4.9.1

12 Apr 09:15
releases/CGAL-4.9.1

Choose a tag to compare

CGAL-4.9.1 is a bug-fix release.

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

CGAL 4.9

19 Sep 15:02
releases/CGAL-4.9

Choose a tag to compare

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

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

General

  • 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.

See http://www.cgal.org/releases.html for a complete list of changes.