Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] CGAL 4.9 Released, Computational Geometry Algorithms Library

Subject: CGAL users discussion list

List archive

[cgal-discuss] CGAL 4.9 Released, Computational Geometry Algorithms Library


Chronological Thread 
  • From: "Laurent Rineau (CGAL/GeometryFactory)" <>
  • To: , , ,
  • Subject: [cgal-discuss] CGAL 4.9 Released, Computational Geometry Algorithms Library
  • Date: Mon, 19 Sep 2016 17:36:06 +0200
  • Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None ; spf=Pass ; spf=None
  • Ironport-phdr: 9a23:EwuGxRFU6pX2+nX3ga+l651GYnF86YWxBRYc798ds5kLTJ7/p8qwAkXT6L1XgUPTWs2DsrQf2rOQ4/yrBjdIoc7Y9itTKNoUD15NoP5VtjRoONSCB0z/IayiRA0BN+MGamVY+WqmO1NeAsf0ag6aiHSz6TkPBke3blItdazLE4Lfx/66y/q1s8WKJV4Z3XztPfgtd1329VyX7ZhOx9M6a+4Y8VjgmjNwYeNYxGdldxq4vi3XwYOOxqNl6DlaoPk79sRNAu3QdqU8SqFEXnx9azhmrPvQsgPfQAe163AdSj9e0kYQQluN0BavVZj4tm72t/F2xTKBFczwV7E9Hzq4q+9gRxbszS4BMTkk9mraos12lqNS5hy741R0xIvMb4ySMb93eKXaYNURSEJAWNxQXmpPGMf0aoYUD8IaNOBUroC7qFwQ/iGzHQ29OOS6wTBBgjr63LYxzv86OQDAxg0pWdwU41rOq9CgfoMbTPq4yrWA9zTFYvpLkXfWx6HsNT8spvSBQahhX8Pa1U41BkKPxgGUoJH/MjWJkP4MtWWS8sJrWuurzWk9pFci8XCU2s4wh9yR1couwVfe+HAlmIs=
  • Organization: GeometryFactory

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:

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


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


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/




Archive powered by MHonArc 2.6.18.

Top of Page