CGAL

CGAL ( Computational Geometry Algorithms Library ) is a geometrical library of calculation . It is developed by several research institutes and companies, mainly Européens: INRIA, the max-Plack Institute für Informatik in Saarbrucken, the University of Tel Aviv, GeometryFactory, the ETH Zurich, the University of Utrecht…

CGAL provides for example the following functionalities:

Calculation of the convex envelope of a whole of points in 2D, 3D or dD
Partitioning 2D in polygons and 3D in polyhedrons
Triangulations of Delaunay 2D and 3D
Diagrams of Voronoï
Generation of grids 2D and 3D
Research of K close closest
Research by intervals, in a space dD (2D, 3D…), by arranges and segment trees
Calcul of Bounding Volumes
Calcul of the optimal distances
ACP
Structures of data kinetic
Solveur of linear and quadratic programming (QP Solver)
and well of others…

CGAL is under a double free license (GNU LGPL and QPL)

External bonds

Official site

Random links: