CGAL is a software project that provides easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as geographic information systems, computer aided design, molecular biology, medical imaging, computer graphics, and robotics.
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 reconstruction, AABB and KD trees...
5.212 Sep 2020 03:16
Release date: December 2020
### CGAL and the Boost Graph Library (BGL).
Added the convenience header `CGAL/boost/graph/graph_traits_inheritance_macros.h` that allows to easily
make any class inheriting from a model of a face graph concept, a model of the same concept.
### 3D Convex Hulls.
Added the function `CGAL::halfspace_intersection_interior_point_3()` that can be used to retrieve
the point that is the most interior a convex volume defined by the intersection of a set of halfspaces.