CGAL users discussion list

[Mael Rouxel-Labbé <>]

On 27/02/2018 16:46, Laurent Rineau (CGAL/GeometryFactory) wrote:
> [...]
>
>
> The CGAL project is a collaborative effort to develop a robust,
> easy-to-use, and efficient C++ software library of geometric data
> structures and algorithms, like
> - triangulations (2D constrained triangulations, Delaunay triangulations
>   and periodic triangulations in 2D and 3D),
> - Voronoi diagrams (for 2D and 3D points, 2D additively weighted
>   Voronoi diagrams, and segment Voronoi diagrams),
> - Boolean operations on polygons and polyhedra,
> - regularized Boolean operations on polygons with curved arcs
> - arrangements of curves,
> - mesh generation (2D, 3D and surface mesh generation,
>   surface mesh subdivision and parametrization),
> - alpha shapes (in 2D and 3D),
> - convex hull algorithms (in 2D, 3D and dD),
> - operations on polygons (straight skeleton and offset polygon),
> - search structures (kd trees for nearest neighbor search, and
>   range and segment trees),
> - interpolation (natural neighbor interpolation and placement of
>   streamlines),
> - optimization algorithms (smallest enclosing sphere of points or
>   spheres, smallest enclosing ellipsoid of points, principal
>   component analysis),
> - kinetic data structures
Should KDS be removed there?

Maybe the whole list could be updated? I can look into it in parallel
with the small update to the website (mail about that... soon).

Mael