CGAL
From Wikipedia, the free encyclopedia
| CGAL | |
|---|---|
| Developed by | CGAL Open Source Project |
| Latest release | 3.3.1 / Sep 5, 2007 |
| Genre | Application framework |
| License | License |
| Website | CGAL Homepage |
The Computational Geometry Algorithms Library (CGAL) is a software library that aims to provide easy access to efficient and reliable algorithms in computational geometry. While primarily written in C++, Python bindings are also available.[1]
The software is available under dual licensing scheme. When used for other open source software, it is available under Open Source Licenses (LGPL or QPL depending on the component). In other cases commercial license may be purchased, under different options for academic/research and industrial customers.[2]
Contents |
[edit] History
The CGAL project was founded in 1996, as a consortium of eight research institutions in Europe and Israel: Utrecht University, ETH Zurich, Free University of Berlin, INRIA Sophia Antipolis, Martin-Luther-University Halle-Wittenberg, Max Planck Institute for Informatics Saarbrücken, Johannes Kepler University Linz, and Tel-Aviv University. The original funding for the project came from the ESPRIT project of the European Union.[3] Originally, its licensing terms allowed its software to be used freely for academic purposes, with commercial licenses available for other uses. The current licensing scheme was introduced in 2003. As of 2007 it is managed by a twelve-member editorial board, with an additional 32 developers and reviewers.[4]
The project started in 1996 as the pooling of the previous efforts of several project participants:PlaGeo and SpaGeo from Utrecht University, LEDA of the Max-Planck-Institute for Informatics and C++GAL of INRIA Sophia-Antipolis. The LEDA library encompasses a broader range of algorithms. A comparison of the two libraries is provided by Kettner and Näher.[5] Three CGAL User workshops held in 2002, 2004, and 2008 highlighted research results related to CGAL,[6] and many additional papers related to CGAL have appeared in other conferences, workshops, and journals.[7]
[edit] Scope
The library covers the following topics
- Geometry kernels - basic geometric operations on geometric primitives
- Arithmetic and algebra
- Convex hull algorithms
- Polygons and polyhedra
- Polygon and polyhedron operations
- Arrangements
- Triangulations
- Delaunay triangulations
- Voronoi diagrams
- Mesh generation
- Geometry processing
- Search structures
- Shape analysis, fitting, and distances
- Interpolation
- Kinetic data structures
[edit] Platforms
The library is supported on a number of platforms.
- MS Windows (GNU g++, MS Visual C++, Intel C++)
- GNU g++ (Solaris, Linux, Mac OS)
The CGAL library depends on the Boost library.
[edit] References
- ^ CGAL Python bindings, developed at INRIA by Naceur Meskini.
- ^ CGAL license
- ^ CGAL Project History.
- ^ CGAL Project Members.
- ^ Kettner, L.; Näher, S. (2004). "Two computational geometry libraries: LEDA and CGAL". Handbook of Discrete and Computational Geometry: 1435–1464..
- ^ CGAL User Workshop program, 2nd CGAL User Workshop program and 3rd CGAL User Workshop program.
- ^ As of 2007, Google scholar lists 89 papers with CGAL in their titles.
