In this talk I will give an overview on what is currently available in CGAL, as well as what is under development. We will see algorithms from the areas 2D vector graphics (e.g., Boolean operations on Bézier curves, off sets, polyline simplification, and geometry on the sphere), point set processing (e.g., normal estimation, denoising, shape detection, and surface reconstruction) surface mesh processing (e.g., Boolean operations, simplification, deformation, segmen tation, and skeletonization), and mesh generation (e.g., surface and volume mesh generation from 3D images, implicit functions, or polyhedral surfaces, anisotropic mesh generation, and mesh generation in periodic spaces).

In the second half of the talk I will cover non-geometric topics: First, the exact geometric computing paradigm that makes CGAL reliable without sac rificing efficiency. Then, the generic programming paradigm that facilitates integration into existing software. Finally, organizational issues, such as how the CGAL project works internally, how students can get involved through our participation in the Google Summer of Code, and how research groups can become project partners.