CGAL - The Computational Geometry Algorithms Library
-
last edited by
The Computational Geometry Algorithms Library
OFFICIAL WEBSITE - MANUAL - TUTORIAL - REFERENCES
CGAL (Computational Geometry Algorithms Library) is a comprehensive library of geometric algorithms. The goal of CGAL is to advance the state of the art of geometric computing and to offer robust and efficient programs for research purpose and industrial applications. The initial development of CGAL is a joint effort of six groups in Europe partially funded by European Projects. The library consists of about 1,000,000 lines of C++ code with users all over the world. Since november 2003, CGAL is an Open Source Project. The spin-off Geometry Factory sells CGAL commercial licenses, support for CGAL and customized developments based on CGAL.
The library offers data structures and algorithms like triangulations, Voronoi diagrams, Boolean operations on polygons and polyhedra, point set processing, arrangements of curves, surface and volume mesh generation, geometry processing, alpha shapes, convex hull algorithms, shape analysis, AABB and KD trees...
Learn more about CGAL by browsing through the Package Overview.
