CGAL
A C++ library providing efficient and reliable algorithms for computational geometry problems.
What is CGAL?
CGAL (Computational Geometry Algorithms Library) is a comprehensive C++ library that provides efficient and reliable implementations of computational geometry algorithms. It solves complex geometric problems including convex hull computation, triangulation, Voronoi diagram generation, and mesh processing. The library is designed to handle numerical precision issues and degenerate cases that commonly arise in geometric computations.
C++ developers working in fields requiring geometric computations such as computer graphics, CAD software, GIS applications, robotics, scientific visualization, and computational mathematics. Researchers and engineers who need robust geometric algorithms for their projects.
Developers choose CGAL because it provides mathematically correct, industrial-strength implementations of complex geometric algorithms that are difficult to implement correctly from scratch. Its header-only design since version 5.0 simplifies integration, while its modular structure allows using only the needed components without unnecessary dependencies.
Overview
The public CGAL repository, see the README below
Use Cases
Best For
- Computing convex hulls of point sets in 2D and 3D
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
