CGAL users discussion list

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

The CGAL Open Source Project is pleased to announce the release 4.3

of CGAL, the Computational Geometry Algorithms Library.

 

Besides fixes to existing packages, the following has changed since

CGAL 4.2:

 

o The CGAL Manual generated with Doxygen

 

The documentation of CGAL is now generated with Doxygen:

http://doc.cgal.org/4.3/

 

The conversion to Doxygen from our home-made tools was not completely

smooth. Please report any documentation bug you may discover to the

Inria Forge bug tracker:

https://gforge.inria.fr/tracker/?atid=13845&group_id=52&func=browse

 

o 2D Periodic Triangulations (new package)

 

This package allows to build and handle triangulations of point sets in

the two dimensional flat torus. Triangulations are built incrementally

and can be modified by insertion or removal of vertices. They offer

point location facilities. The package provides Delaunay triangulations

and offers nearest neighbor queries and primitives to build the dual

Voronoi diagrams.

 

 

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/