Generic Geometric Programming in the Computational Geometry Algorithms Library

This paper describes a number of design issues and programming paradigms that affect the development of Cgal, the computational geometry algorithms library. Genericity of the library is achieved by concepts such as templates, iterators, and traits classes. This allows the application programmer to plug in own types of containers and point types, for example. The paper gives an explanation of these concepts and examples of how they are used.