Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] CGAL 4.1 Released, Computational Geometry Algorithms Library

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] CGAL 4.1 Released, Computational Geometry Algorithms Library


Chronological Thread 
  • From: 刘先勇 <>
  • To:
  • Subject: Re: [cgal-discuss] CGAL 4.1 Released, Computational Geometry Algorithms Library
  • Date: Wed, 31 Oct 2012 10:29:09 +0800

Oh, CONGRATULATIONS!!!!! 

BTW, I would like ask about zlib in CGAL, though  we can built CGAL 4.1 without errors.

We build it on windows platform. In the CMake GUI, we only have a checkbox WITH_ZLIB to (de)select;
where can we and should we specify the include and library paths for zlib???

We added them manually, but got warning message:
Manually-specified variables were not used by the project.

Concerning this, will be there potential problems in our future applications??

Best Regards,
Xianyong Liu.



2012/10/24 Laurent Rineau (CGAL/GeometryFactory) <>
The CGAL Open Source Project is pleased to announce the release 4.1
of CGAL, the Computational Geometry Algorithms Library.

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

 o New compiler support

     The Apple Clang compiler versions 3.1 and 3.2 are now supported on
     Mac OS X.


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 and Delaunay
  triangulations in 2D and 3D, periodic triangulations),
- 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/


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






Archive powered by MHonArc 2.6.18.

Top of Page