Computational geometry algorithms library

Abstract

The CGAL C++ library offers geometric data structures and algorithms that are reliable, efficient, easy to use, and easy to integrate in existing software. Use of de facto standard libraries like CGAL increases productivity, because they allow software developers to focus on the application layer. This course is an overview of CGAL geometric algorithms and data structures. The lectures cover: •CGAL for 2D vector graphics, including Boolean operations on Bézier curves, offsets, simplification, and geometry on the sphere. •CGAL for 3D point sets, including principal component analysis, bounding volumes, simplification, outlier removal, normal estimation, normal orientation, denoising, triangulation, and surface reconstruction. •CGAL for mesh-based modeling and processing, including Boolean operations, convex decomposition, simplification, and parameterization. •CGAL for mesh generation, including surface and volume mesh generation, from 3D images, implicit functions, or polyhedral surfaces. The introductory lecture covers non-geometric topics: the exact geometric computing paradigm that makes CGAL reliable without sacrificing efficiency and the generic programming paradigm that facilitates integration into existing software.