CGAL is a C++ library that provides efficient and reliable algorithms in computational geometry.
The library addresses the challenge of implementing complex geometric algorithms by offering a comprehensive collection of well-tested, production-ready implementations. It covers fundamental computational geometry problems including convex hull computation, triangulation in two and three dimensions, Voronoi diagrams, polygon operations, mesh processing, and point cloud handling. As a header-only library, CGAL eliminates the need for separate compilation steps, allowing developers to include it directly in their projects through CMake configuration.
CGAL suits projects requiring robust geometric computation where correctness and performance are critical. This includes applications in computer graphics, mesh generation, spatial analysis, and geometric modeling. The library is particularly valuable when you need to avoid reimplementing well-known algorithms or when you require certified correctness in geometric operations. The project organizes functionality into packages, each implementing specific data structures or algorithms, making it possible to use only the components your project needs.
The project maintains a structured development process with organized package architecture separating core algorithms from infrastructure concerns like documentation, testing, and build support. The repository includes comprehensive testing infrastructure with daily testsuite results publicly available, indicating systematic quality assurance. Development guidelines and onboarding documentation for new contributors are maintained in the project wiki, suggesting an established process for community participation. The project releases source distributions twice yearly through its official website, providing stable versions alongside the actively developed main branch.
