Also found in: Wikipedia.
CGALComputational Geometry Algorithms Library
References in periodicals archive ?
Our goal was to investigate the available CGAL data structures for triangulation in both 2D and 3D and to identify the possibilities and limitations of CGAL.
However, the triangulation data structure used by CGAL does not contain explicit edges.
The implementation follows the steps given above for 2D feature overlay in TIN by the following custom-code, non-standard CGAL functions:
CGAL (Computational Geometry Algorithms Library) 2000.
The CGAL kernel: A basis for geometric computation.