Generic Geometric Programming in the Computational Geometry Algorithms Library
View/
Date
1999Pay-Per-View via TIB Hannover:
Try if this item/paper is available.
Metadata
Show full item recordAbstract
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.
BibTeX
@article {10.1111:1467-8659.00363,
journal = {Computer Graphics Forum},
title = {{Generic Geometric Programming in the Computational Geometry Algorithms Library}},
author = {Veltkamp, Remco C.},
year = {1999},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00363}
}
journal = {Computer Graphics Forum},
title = {{Generic Geometric Programming in the Computational Geometry Algorithms Library}},
author = {Veltkamp, Remco C.},
year = {1999},
publisher = {Blackwell Publishers Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/1467-8659.00363}
}