CGAL 4.14 Beta 2 Released, Computational Geometry Algorithms Library

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
|

CGAL 4.14 Beta 2 Released, Computational Geometry Algorithms Library

Laurent Rineau (CGAL/GeometryFactory)
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.

  https://github.com/CGAL/cgal/milestone/42?closed=1


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 project is a collaborative effort to develop a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms, like
- triangulations (2D constrained triangulations, Delaunay triangulations
  and periodic triangulations in 2D and 3D),
- Voronoi diagrams (for 2D and 3D points, 2D additively weighted
  Voronoi diagrams, and segment Voronoi diagrams),
- Boolean operations on polygons and polyhedra,
- regularized Boolean operations on polygons with curved arcs
- arrangements of curves,
- mesh generation (2D, 3D and surface mesh generation,
  surface mesh subdivision and parametrization),
- alpha shapes (in 2D and 3D),
- convex hull algorithms (in 2D, 3D and dD),
- operations on polygons (straight skeleton and offset polygon),
- search structures (kd trees for nearest neighbor search, and
  range and segment trees),
- interpolation (natural neighbor interpolation and placement of
  streamlines),
- optimization algorithms (smallest enclosing sphere of points or
  spheres, smallest enclosing ellipsoid of points, principal
  component analysis).




Some modules are distributed under the terms of the LGPL Open Source
license (GNU Lesser General Public License v3 or later versions).
Most modules are distributed under the terms of the GPL Open Source
license (GNU General Public License v3 or later versions).
If your intended usage does not meet the criteria of the
aforementioned licenses, a commercial license can be purchased from
GeometryFactory (http://www.geometryfactory.com/).


For further information and for downloading the library and its
documentation, please visit the CGAL web site: https://www.cgal.org/


--
Laurent Rineau, PhD
R&D Engineer at GeometryFactory           http://www.geometryfactory.com/
Release Manager of the CGAL Project       http://www.cgal.org/




--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss