cgal

CGAL-4.14.2 is a bug-fix release.

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

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.

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.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 is a bug-fix release.

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

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 is a bug-fix release.

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

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.

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

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

Compared to CGAL version 4.14 Beta 1, this version fixes several bugs including one that prevented the build of all CGAL demos.

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/13/cgal414-beta2/ for a complete list of changes.

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

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

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/04/cgal414-beta1/ for a complete list of changes.

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

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

3D Periodic Mesh Generation (new package)

• This package generates 3-dimensional periodic meshes. It computes isotropic simplicial meshes for domains described through implicit functional boundaries over the flat torus (which can also seen in the Euclidean space as a periodic cube). The output is a periodic 3D mesh of the domain volume and conformal surface meshes for all the boundary and subdividing surfaces. The package is closely related to the 3D Mesh Generation package, with similar concepts, classes, and API.

Classification

• This package can now handle classification of surface meshes and clusters, and can compute features in parallel.

See https://www.cgal.org/2018/10/01/cgal413/ for a complete list of changes.

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

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

3D Periodic Mesh Generation (new package)

• This package generates 3-dimensional periodic meshes. It computes isotropic simplicial meshes for domains described through implicit functional boundaries over the flat torus (which can also seen in the Euclidean space as a periodic cube). The output is a periodic 3D mesh of the domain volume and conformal surface meshes for all the boundary and subdividing surfaces. The package is closely related to the 3D Mesh Generation package, with similar concepts, classes, and API.

Classification

• This package can now handle classification of surface meshes and clusters, and can compute features in parallel.

See https://www.cgal.org/2018/09/11/cgal413-beta2/ for a complete list of changes.

CGAL-4.12.1 is a bug-fix release.

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

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

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

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

3D Periodic Mesh Generation (new package)

• This package generates 3-dimensional periodic meshes. It computes isotropic simplicial meshes for domains described through implicit functional boundaries over the flat torus (which can also seen in the Euclidean space as a periodic cube). The output is a periodic 3D mesh of the domain volume and conformal surface meshes for all the boundary and subdividing surfaces. The package is closely related to the 3D Mesh Generation package, with similar concepts, classes, and API.

Classification

• This package can now handle classification of surface meshes and clusters, and can compute features in parallel.

See https://www.cgal.org/2018/08/01/cgal413-beta1/ for a complete list of changes.

CGAL-4.11.3 is a bug-fix release. It fixes one bug since CGAL-4.11.2.

CGAL-4.11.2 is a bug-fix release.

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

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

WARNING: This release features an important change of the CMake scripts
used to configure the CGAL libraries and examples. 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. Please read the first paragraph of the release notes
carefully.

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

Using CGAL Header-only

• It is now possible to use CGAL without configuring it with CMake, as a
  header-only library. Note that, even if CGAL is header-only, its
  dependencies (such as GMP and MPFR) are not all header-only.

Compiler Support

• The Microsoft Visual C++ 2017 version 15.3 has introduced support for
  C++17, with the compilation flag /std:c++17. CGAL 4.12 has an initial
  support for that flag: the code will compile, but a lot of deprecation
  warnings will remain. Note that Boost version 1.67 is the first version
  of Boost supporting /std:c++17.

• The compilation flag /permissive- of Visual C++ is now supported.

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 https://www.cgal.org/2018/04/25/cgal412/ for a complete list of
changes.

Project is pleased to announce the release 4.12 Beta 2
of CGAL, the Computational Geometry Algorithms Library.

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

WARNING: This release features an important change of the CMake scripts
used to configure the CGAL libraries and examples. 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. Please read the first paragraph of the release notes
carefully.

Note that, since the release CGAL-4.12 Beta 1, the header-only mode of CGAL
has been modified, and documented.

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

Using CGAL Header-only

• It is now possible to use CGAL without configuring it with CMake, as a
  header-only library. Note that, even if CGAL is header-only, its
  dependencies (such as GMP and MPFR) are not all header-only.

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 https://www.cgal.org/2018/02/27/cgal412-beta1/ for a complete list of
changes.