Subject: CGAL users discussion list
List archive
Re: [cgal-discuss] CGAL 3.7 Released, Computational Geometry Algorithms Library
Chronological Thread
- From: JIA Pei <>
- To:
- Subject: Re: [cgal-discuss] CGAL 3.7 Released, Computational Geometry Algorithms Library
- Date: Mon, 18 Oct 2010 21:36:14 +0800
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; b=j+nAMmPB0cMDetOhh/X9QSRPaPtr3tvnPBvcrfQ8XLmBBUXA323hdgWnf8vkI2RB9a bdngNaO4gMIZc0u431CktUauaLGAFhiSmamwoJUkRTpR6Et4q/P6F7D3X1o2mHIeb0MG tFqVH1xm7mTGnua/Nq4gif4nvPR+FcBr5bZJo=
Glad CGAL released 3.7
I'm wondering has current CGAL contained Tandem algorithm or not,
for the purpose of generalized procrustes analysis?
Best Regards
JIA
On Mon, Oct 18, 2010 at 5:42 PM, Laurent Rineau (GeometryFactory) <> wrote:
The CGAL Open Source Project is pleased to announce the Release 3.7
of CGAL, the Computational Geometry Algorithms Library.
CGAL-3.7 provides improvements and fixes to existing packages, and support
for new compilers.
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 in
2D and 3D, periodic Delaunay triangulations in 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 generations)
and processing (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 v2.1).
Most modules are distributed under the terms of the QPL Open Source
license (Q Public License v1.0).
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://lists-sop.inria.fr/wws/info/cgal-discuss
--
Welcome to Vision Open
http://www.visionopen.com
- [cgal-discuss] CGAL 3.7 Released, Computational Geometry Algorithms Library, Laurent Rineau (GeometryFactory), 10/18/2010
- Re: [cgal-discuss] CGAL 3.7 Released, Computational Geometry Algorithms Library, JIA Pei, 10/18/2010
- Re: [cgal-discuss] CGAL 3.7 Released, Computational Geometry Algorithms Library, Joachim Reichel, 10/19/2010
Archive powered by MHonArc 2.6.16.