CGAL

CGAL
CGAL
Developer(s) CGAL Open Source Project
Stable release 3.8 / April 19, 2011
Written in C++
Operating system Multi-platform
Type 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 and Scilab bindings are also available.[1] [2]

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.[3]

Contents

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.[4] 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 2009 it is managed by a fourteen-member editorial board, with an additional 30 developers and reviewers.[5]

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.[6] Three CGAL User workshops held in 2002, 2004, and 2008 highlighted research results related to CGAL,[7] and many additional papers related to CGAL have appeared in other conferences, workshops, and journals.[8]

Scope

The library covers the following topics

Platforms

The library is supported on a number of platforms.

The CGAL library depends on the Boost library.

References

  1. ^ CGAL Python bindings, developed at INRIA by Naceur Meskini and Sylvain Pion.
  2. ^ CGAL Scilab bindings, developed at Scilab and INRIA by Edyta Przymus, Naceur Meskini and Sylvain Pion.
  3. ^ CGAL license
  4. ^ CGAL Project History.
  5. ^ CGAL Project Members.
  6. ^ Kettner, L.; Näher, S. (2004). "Two computational geometry libraries: LEDA and CGAL". Handbook of Discrete and Computational Geometry. pp. 1435–1464. .
  7. ^ CGAL User Workshop program, 2nd CGAL User Workshop program and 3rd CGAL User Workshop program.
  8. ^ As of 2010, Google scholar lists 137 papers with CGAL in their titles.

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • CGAL — Computational Geometry Algorithms Library CGAL Développeur CGAL Open Source Project …   Wikipédia en Français

  • Computational Geometry Algorithms Library — CGAL Développeur CGAL Open Source Project Dernière version …   Wikipédia en Français

  • Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown In mathematics and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of… …   Wikipedia

  • Institut national de recherche en informatique et en automatique — Création 3  …   Wikipédia en Français

  • Quadratic programming — (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables.The quadratic programming problem… …   Wikipedia

  • Point location — The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided… …   Wikipedia

  • Subdivision surface — A subdivision surface, in the field of 3D computer graphics, is a method of representing a smooth surface via the specification of a coarser piecewise linear polygon mesh. The smooth surface can be calculated from the coarse mesh as the limit of… …   Wikipedia

  • Mesh generation — is the practice of generating a polygonal or polyhedral mesh that approximates a geometric domain. The term grid generation is often used interchangeably. Typical uses are for rendering to a computer screen or for physical simulation such as… …   Wikipedia

  • Line segment intersection — In computational geometry, the line segment intersection problem supplies a list of line segments in the plane and asks us to determine whether any two of them intersect, or cross.Naive algorithms examine each pair of segments, but this is highly …   Wikipedia

  • Kd-trie — A k d trie is a spatial data structure for indexing points in k dimensional space. It is a variation on the k d tree that only stores points in the leaf nodes, sometimes in small collections called bins or buckets. Internal nodes only store the… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”