Difference between revisions of "CGAL"
(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...") |
(New version) |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 4: | Line 4: | ||
|Full description=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...<br /> | |Full description=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...<br /> | ||
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. | 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. | ||
| + | |Homepage URL=http://cgal.org/ | ||
|User level=none | |User level=none | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Computer languages=C++ | |Computer languages=C++ | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Keywords=C++,Computational Geometry,Software Library | |Keywords=C++,Computational Geometry,Software Library | ||
| − | | | + | |Version identifier=4.9 |
| − | |Last review by= | + | |Version date=2016/09/19 |
| − | |Last review date= | + | |Version status=stable |
| + | |Version download=https://github.com/CGAL/cgal/archive/releases/CGAL-4.9.tar.gz | ||
| + | |Last review by=Alejandroindependiente | ||
| + | |Last review date=2017/03/09 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
| − | | | + | |Status= |
| − | | | + | |Is GNU=No |
| − | |||
| − | |||
|License verified date=2006-10-12 | |License verified date=2006-10-12 | ||
| − | | | + | }} |
| + | {{Project license | ||
| + | |License=LGPL | ||
| + | |License verified by=Mviinama | ||
| + | |License verified date=2014-09-20 | ||
| + | }} | ||
| + | {{Project license | ||
| + | |License=GPL | ||
| + | |License verified by=Mviinama | ||
| + | |License verified date=2014-09-20 | ||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=The CGAL Developers | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
| − | |||
|Resource URL= | |Resource URL= | ||
}} | }} | ||
| Line 61: | Line 61: | ||
}} | }} | ||
{{Software category | {{Software category | ||
| − | |Graphics= | + | |Graphics=2d, 3d |
|Interface=library | |Interface=library | ||
| − | |||
|Use=library | |Use=library | ||
|Works-with=graphics | |Works-with=graphics | ||
}} | }} | ||
| − | {{ | + | {{Featured}} |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | }} | ||
Latest revision as of 20:15, 8 March 2017
CGAL
http://cgal.org/
A Computational Geometry Algorithms Library
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.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
| Contact(s) | Role |
|---|---|
| The CGAL Developers | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| Help | https://lists-sop.inria.fr/wws/info/cgal-announce | |
| Developer | Mailing List Info/Archive | https://lists-sop.inria.fr/wws/info/cgal-discuss |
| Bug Tracking,Support | mailto:cgal-discuss@lists-sop.inria.fr | |
| Support | https://lists-sop.inria.fr/wws/info/cgal-discuss | |
| Help | mailto:cgal-announce@lists-sop.inria.fr |
Software prerequisites
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.