CGAL 5.1

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...

Tags c++ mathematics visualization
License GNU GPLv3
State alpha

Recent Releases

5.116 Jan 2020 06:25 minor feature: Release date: June 2020 ### Surface Mesh Topology (new package). - This package allows to compute some topological invariants of. Surfaces. For now, it is possible to test if two () curves on a combinatorial surface are homotopic. The user can choose. Between free homotopy and homotopy with endpoints. A contractibility test is also provided. 3D Fast Intersection and Distance Computation: Breaking change: the internal search tree is now lazily constructed. To disable it, one must call. The new function `do_not_accelerate_distance_queries()` before the first distance query. Polygon Mesh Processing: Introduced a new function, `CGAL::Polygon_mesh_processing::remove_connected_components_of_negligible_size()`. Which can be used to remove connected components whose area or volume is under a certain threshold. Area and volume thresholds are either specified by the user or deduced from the bounding box of the mesh. Added a new named parameter for `keep_large_connected_components()` and `remove_connected_components_of_negligible_size`. That can be used to perform a dry run of the operation, meaning that the function will return the number of connected Components that would be removed with the specified threshold, but without actually removing them. The function `CGAL::Polygon_mesh_processing::stitch_borders()` now returns the number of halfedge pairs that were stitched. 2D Triangulations: To an inconsistency between code and documentation and to clarify which types of intersections. Are truly allowed in constrained Delaunay triangulations, the tag `CGAL::No_intersection_tag` Has been deprecated in favor of two new tags `CGAL::No_constraint_intersection_tag` And `CGAL::No_constraint_intersection_requiring_constructions_tag`. The latter is equivalent to the now-deprecated `CGAL::No_intersection_tag`, and allows constraints to intersect as long as no new point has to be created to represent that intersection (for example. The intersection of two constrain
5.030 Sep 2019 16:45 minor feature: https://github.com/CGAL/cgal/releases/tag/releases 2FCGAL-5.0