Free Software Foundation!

Join now

Difference between revisions of "CGAL"

From Free Software Directory
Jump to: navigation,
(Created page with "{{Entry |Name=CGAL |Short description=A Computational Geometry Algorithms Library |Full description=The goal of the CGAL Project is to provide easy access to efficient and reliab...")
 
Line 61: Line 61:
 
}}
 
}}
 
{{Software category
 
{{Software category
|Graphics=2D,3d
+
|Graphics=2d,3d
 
|Interface=library
 
|Interface=library
 
|Library=c++
 
|Library=c++

Revision as of 13:47, 12 April 2011

[edit]

CGAL

https://cgal.org/
The goal of the CGAL Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods...
CGAL offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay 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, arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums) mesh generation (2D Delaunay mesh generation and 3D surface mesh generation, skin surfaces), geometry processing (surface mesh simplification, subdivision and parameterization, as well as estimation of local differential properties, and approximation of ridges and umbilics), alpha shapes, 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), shape analysis, fitting, and distances (smallest enclosing sphere of points or spheres, smallest enclosing ellipsoid of points, principal component analysis), and kinetic data structures. All these data structures and algorithms operate on geometric objects like points and segments, and perform geometric tests on them. These objects and predicates are regrouped in CGAL Kernels.


Download

Download version 4.4 (stable)
released on 4 April 2014

Categories




Licensing

LicenseVerified byVerified onNotes
LGPLMviinama20 September 2014
GPLMviinama20 September 2014



Leaders and contributors

Contact(s)Role
The CGAL DevelopersMaintainer


Resources and communication

Audience Resource type URI
Help E-mail https://lists-sop.inria.fr/wws/info/cgal-announce
Support E-mail https://lists-sop.inria.fr/wws/info/cgal-discuss
Help E-mail mailto:cgal-announce@lists-sop.inria.fr
Bug Tracking,Support E-mail mailto:cgal-discuss@lists-sop.inria.fr
Developer Mailing List Info/Archive https://lists-sop.inria.fr/wws/info/cgal-discuss


Software prerequisites

This entry (in part or in whole) was last reviewed on 12 October 2006.



Entry




























Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.

The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.


Personal tools
Namespaces

Variants
Actions
Navigation
Contribute