CGAL/cgal
Cgal
CGAL is a software library that provides a comprehensive collection of computational geometry algorithms and data structures. It is built around a geometry kernel that defines fundamental geometric primitives and operations, enabling the construction of complex geometric objects and the computation of geometric predicates with exact arithmetic for reliable results.
The library covers a wide range of geometric computation capabilities, including the construction of convex hulls, triangulations of point sets, and the generation of Voronoi diagrams. It also supports the processing of polygonal meshes and point clouds, as well as the computation of arrangements of curves in the plane and Boolean operations on polygons. For spatial analysis, CGAL provides geometric queries such as point location and distance computation, and it can generate high-quality surface and volume meshes for simulation.
Beyond core geometry, CGAL includes optimization solvers for linear and quadratic programs, and offers spatial sorting of geometric objects to accelerate proximity searches. The library is extensible, allowing users to write custom algorithms that integrate with the existing framework, and it provides control over runtime checks and error handling. Documentation is available online for interactive browsing and as downloadable manuals for offline reference.
Features
- Geometry Kernel Foundations - Provides the foundational geometry kernel that underpins all computational geometry algorithms.
- Simulation Meshes - Creates high-quality triangular or tetrahedral meshes from input geometries for simulation.
- Surface and Volume Meshes - Creates meshes from geometric domains for finite element analysis and visualization.
- Traitement de nuages de points - Analyzes and filters unstructured point sets for surface reconstruction.
- Spatial Data Structures - Constructs complex spatial data structures like triangulations, arrangements, and meshes.
- Mesh Processing Operations - Applies smoothing, simplification, and hole filling operations on polygonal surfaces.
- Boolean Polygon Operations - Computes union, intersection, difference, and symmetric difference of polygons and polyhedra.
- Complex Polygon Modeling - Represents and manipulates cell complexes, polygons, and polyhedra for 3D modeling.
- Mesh Processing Tools - Provides tools for refining, simplifying, and repairing polygonal surface meshes.
- Triangulation Generators - Triangulates point sets into triangle or tetrahedral meshes for analysis.
- Geometric Algorithms - Implements exact geometric predicates for orientation and relative position evaluation.
- Geometric Intersection Calculators - Performs point location, intersection detection, and distance computation on geometric objects.
- Convex Hull Computation - Implements convex hull algorithms for 2D and 3D point sets.
- Spatial Queries - Performs spatial searches such as nearest neighbor and range queries on geometric data.
- Coordinate-Based Object Constructors - Builds geometric objects like points, vectors, and lines from coordinate data.
- Voronoi Diagram Generators - Computes Voronoi diagrams from point sets to partition space based on proximity.
- Geometric Primitives - Provides fundamental geometric primitives like points, lines, and polygons for algorithm construction.
- Planar Arrangements - Ships algorithms for computing arrangements of curves in the plane.
- Kernel Number Type Selectors - Allows selection of kernel representation and number type to control arithmetic precision and performance.
- Spatial Sorting - Sorts geometric objects spatially to accelerate proximity searches and range queries.
- Spatial Sorting - Orders points or other geometric entities along a space-filling curve for efficient access.
- Custom Algorithm Extensions - Enables users to write custom data structures and algorithms that integrate with the framework.
- Mathematical Libraries - Collection of geometric algorithms.
