Algorithm-oriented generic libraries
Software—Practice & Experience
Curiously recurring template patterns
C++ Report
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Interval arithmetic yields efficient dynamic filters for computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
The C++ standard library: a tutorial and reference
The C++ standard library: a tutorial and reference
Using generic programming for designing a data structure for polyhedral surfaces
Computational Geometry: Theory and Applications - Special issue on applications and challenges
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
The C++ Programming Language, Third Edition
The C++ Programming Language, Third Edition
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
The CGAL Kernel: A Basis for Geometric Computation
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on these representations. This paper describes how such a geometry kernel can be designed and implemented in C++, having special emphasis on adaptability, extensibility and efficiency. We achieve these goals following the generic programming paradigm and using templates as our tools. These ideas are realized and tested in Cgal [9], the Computational Geometry Algorithms Library.