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
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
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Look — a Lazy Object-Oriented Kernel for geometric computation
Proceedings of the sixteenth annual symposium on Computational geometry
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
Interval arithmetic yields efficient dynamic filters for computational geometry
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
The C++ Programming Language, Third Edition
The C++ Programming Language, Third Edition
Designing the Computational Geometry Algorithms Library CGAL
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
The CGAL Kernel: A Basis for Geometric Computation
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Towards and open curved kernel
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere
Computational Geometry: Theory and Applications
A generic lazy evaluation scheme for exact geometric computations
Science of Computer Programming
| 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, the Computational Geometry Algorithms Library, see http://www.cgal.org/.