CGAL, the Computational Geometry Algorithms Library, is a large C++ library of geometric data structures and algorithms such as Delaunay triangulations, mesh generation, Boolean operations on polygons, and various geometry processing algorithms. CGAL is used in various areas: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, and numerical methods.
|Tags||Scientific/Engineering Visualization Medical Science Mathematics Image Recognition Geographical Bioinformatics Software Development Libraries Application Frameworks|
|Operating Systems||OS Independent|
Release Notes: This release changes the licence to the GPLv3+. There are improvements and bugfixes.
Release Notes: The main new features in this release are surface reconstruction from point sets, 3D mesh generation, point set processing, AABB tree, 3D periodic triangulations, and CGAL_ipelets.
Release Notes: An important change from CGAL 3.3 to 3.4 is the switch to CMake for the installation. Besides improvements to existing packages, this release offers the following new algorithms and data structures: Polynomial (provides multi-variate polynomials), Modular Arithmetic (provides arithmetic over finite fields), 3D Spherical Geometry Kernel (provides functionalities on spheres, circles, circular arcs, and line segments in 3D), CGAL and the Qt4 GraphicsView (many 2D objects can be rendered in a QGraphicsView).
Release Notes: New packages in CGAL 3.3 include surface mesh simplification, estimation of local differential properties, approximation of ridges and umbilics on triangulated surface meshes, envelopes of curves in 2D and surfaces in 3D, Minkowski sums in 2D, an interface between CGAL and the Boost Graph Library (BGL), spatial sorting of points (for efficient triangulations), a linear and quadratic programming solver, and meshing of skin surfaces. CGAL 3.3 also contains many improvements and bugfixes to existing packages.