User:Andreas Fabri/cgal.org
From Wikipedia, the free encyclopedia
CGAL, the Computational Geometry Algorithms Library, is a collection of data structures and algorithms of the field of Computational geometry.
Contents |
[edit] Overview
The library offers Delaunay triangulations, Voronoi diagrams and convex hull algorithms for points in 2D, 3D, and dD space, segment Voronoi diagrams, additively weight Voronoi diagrams, Boolean operations on polygons and on polyhedra, to name but a few.
[edit] Design of CGAL
CGAL follows the generic programming paradigm of the C++ language, with extensive use of templates. This makes it particularly easy to integrate data structures in existing software.
CGAL further follows the exact computing paradigm to cope with problems induced by rounding errors when using floating point arithmetic.
[edit] CGAL Project
The library is developed by an Open Source project that started development in 1996.
