Generic Geometric Programming in the Computational Geometry Algorithms Library

Simple item page
dc.contributor.authorVeltkamp, Remco C.en_US
dc.date.accessioned2015-02-16T06:27:16Z
dc.date.available2015-02-16T06:27:16Z
dc.date.issued1999en_US
dc.description.abstractThis 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.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume18en_US
dc.identifier.doi10.1111/1467-8659.00363en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages131-137en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00363en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleGeneric Geometric Programming in the Computational Geometry Algorithms Libraryen_US
Files
Collections
Issue 2