C++ library of computational geometry and geometry processing

CGAL is a software library that offers a number of reliable geometric data structures and algorithms. CGAL components operate in 2D and 3D, and sometime in arbitrary dimensions. Examples of components include convex hulls, convex decomposition, Delaunay triangulations, Voronoi diagrams, polygonal surface mesh data-structures, mesh generation, Boolean operations, envelope computations, intersection detection, surface reconstruction, and subdivision surfaces.

CGAL is used in a variety of application domains such as CAD/CAM (computer aided design and modeling), GIS (geographic information systems), geophysics, image processing, molecular biology, robotics, motion planning, and graphics.

CGAL is written in C++ and rigorously adheres to the generic-programming paradigm.

CGAL became an Open Source project in 2003. Most of CGAL is under the GPL v3+ license, and some core parts are under the LGPL v3+. The semi-annual releases have currently about 10,000 downloads. CGAL is commercially supported by the spin-off company GeometryFactory.

lightbulb_outline View ideas list


  • c++
  • github
  • git


email Mailing list
mail_outline Contact email

CGAL Project 2018 Projects

  • Liubomyr Piadyk
    Approximate Convex Decomposition of Volumes Bounded by Triangle Meshes
    The algorithm in this project was proposed by Khaled Mamou and Faouzi Ghorbel. It’s an efficient approach to decompose a concave 3D mesh into a set...
  • Apurva Kamlesh Bhatt
    Develop a demo to demonstrate the use of Boolean operations and Minkowski sum
    CGAL works on computational geometry. It has 2 packages named '2D Regularized Boolean Set Operations' and '2D Minkowski Sum'. My task is to build a...
  • Keyu Chen
    Extending Generalized Barycentric Coordinates
    This project aims at providing another two powerful generalized barycentric coordinates Harmonic coordinates and Maximum Entropy coordinates that...
  • Christina Vaz
    Fast and Flexible Distance Transforms in CGAL
    A wide variety of problems in scientific computing and data analysis need to compute accurate shortest paths and distances along curved domains...
  • Thien Hoang
    Generalized Region Growing
    Apply the Region Growing algorithm to any user-defined elements
  • Vasudha Varadarajan
    Smooth Surface Reconstruction
    The current implementation of Poisson Surface Reconstruction algorithm in CGAL constructs a continuous, piecewise linear implicit function, i.e. it...
  • Tong ZHAO
    Spectral Surface Reconstruction
    This project aims to build a package for reconstruction watertight surfaces from un-oriented point sets. The first step is to estimate un-oriented...