CGAL users discussion list

["Laurent Rineau (CGAL/GeometryFactory)" <>]

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

Besides fixes to existing packages, the following has changed since
CGAL 4.7:

  o General

    - The support for Qt3 is dropped and all demos using it got removed.


  o Installation

    - Starting with Visual C++ 2015 we no longer require Boost.Thread as we
      use the C++11 keyword thread_local and the C+11 class std::mutex.

    - The same holds for g++ 4.8 or later when the C++11 standard is used.


  o Optimal Transportation Curve Reconstruction (new package)

    - This package implements a method to reconstruct and simplify 2D point
      sets.  The input is a set of 2D points with mass attributes, possibly
      hampered by noise and outliers. The output is a set of line segments
      and isolated points which approximate the input points.

  o 3D Mesh Generation
  
    - Add support of 3D gray level images as input for the tetrahedral mesh
      generation.

  o Polygon Mesh Processing

    - Add a new triangle-based isotropic remeshing algorithm for
      triangulated surface meshes.

  o Point Set Processing
  
    - Add Concurrency_tag to the functions compute_average_spacing(),
      edge_aware_upsample_point_set(), jet_estimate_normals(),
      jet_smooth_point_set(), and pca_estimate_normals().


See http://www.cgal.org/releases.html 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),
- kinetic data structures




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: http://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/