On the design of CGAL a computational geometry algorithms library

By Andreas Fabri, G. Giezeman, L. Kettner, S. Schirra, S. Schönherr. Software, Practice & Experience, 2000

297 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Variational tetrahedral meshing (2005, methodology): “For efficiency as well as robustness, we opted to use the Computational Geometry Algorithms Library (CGAL [Fabri et al. 2000]) for the input mesh data structure, as well as for the 3D Delaunay triangulation using robust arithmetics.”
CGAL - The Computational Geometry Algorithms Library (2011, methodology): “The design of CGAL [11, 12] follows the generic programming and the exact geometric computing paradigm.”
Anisotropic polygonal remeshing (2003, methodology): “These extracted polygons being possibly concave we perform a convex decomposition using an implementation of Greene’s dynamic programming algorithm [Greene 1983] (also included in CGAL).”
Towards jetography (2009, methodology): “This is the point where FastJet switches from an Nn (tiled) algorithm to the N lnN CGAL-based one.”
The anti-$k_t$ jet clustering algorithm (2008, methodology): “The full class of generalised kt algorithms is amenable to fast implementation using the techniques of [19], with the proviso that for p < 0, the specific manner in which particles are clustered triggers a worst-case scenario for the Voronoi-diagram based dynamic nearest-neighbour graph determinatio”