TY - CHAP
T1 - Code flexibility and program efficiency by genericity
T2 - Improving CGAL'S arrangements
AU - Fogel, Efi
AU - Wein, Ron
AU - Halperin, Dan
PY - 2004
Y1 - 2004
N2 - Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of CGAL, the Computational Geometry Algorithms Library, making it easier to use, to extend and to adapt to a variety of applications. This improved flexibility of the code does not come at the expense of efficiency as we mainly use generic-programming techniques, which make dexterous use of the compilation process. To the contrary, we expedited key operations as we demonstrate by experiments.
AB - Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of CGAL, the Computational Geometry Algorithms Library, making it easier to use, to extend and to adapt to a variety of applications. This improved flexibility of the code does not come at the expense of efficiency as we mainly use generic-programming techniques, which make dexterous use of the compilation process. To the contrary, we expedited key operations as we demonstrate by experiments.
UR - http://www.scopus.com/inward/record.url?scp=35048865304&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30140-0_59
DO - 10.1007/978-3-540-30140-0_59
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:35048865304
SN - 3540230254
SN - 9783540230250
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 664
EP - 676
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Albers, Susanne
A2 - Radzik, Tomasz
PB - Springer Verlag
ER -