CGAL Project

C++ library of computational geometry

Technologies
c++, qt
Topics
geometry, mesh processing, computation geometry, geometry processing
C++ library of computational geometry
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.
2023 Program

Successful Projects

Contributor
William Wen
Mentor
Sven Oesau, Martin Skrodzki
Organization
CGAL Project
Constraint-based Point Set Denoising
Many applications of point set surfaces work with noisy point sets, requiring a denoising operation to reconstruct the original surface. This project...
Contributor
Hossam Mohamed Saeed
Mentor
sloriot, Sébastien Valette
Organization
CGAL Project
Approximated (Discrete) Centroidal Voronoi Diagrams
This project introduces a new simplification (and remeshing) framework to CGAL. Based on the Approximated Centroidal Voronoi Diagrams (ACVD) project...
Contributor
Mathieu LADEUIL
Mentor
Mael, Pierre Alliez
Organization
CGAL Project
Clustering 3D point clouds
- 1 weeks understanding the article and making small code test to get into the CGAL architecture at this point I should be able to manipulate the...
Contributor
Ken Arroyo Ohori
Mentor
sloriot, Andreas Fabri
Organization
CGAL Project
Polygon repair
Polygons are defined by one outer ring and possibly multiple inner rings representing holes, where each ring is usually represented as a sequence of...
Contributor
Tolga Yildiz
Mentor
sloriot, Andreas Fabri
Organization
CGAL Project
Vulkan API backend replacement
CGAL has been using OpenGL API to generate its visuals in the 3D demonstrations. With recent MacOS update there, OpenGL support has ben deprecated by...
Contributor
Dániel Unyi
Mentor
Mael, Roberto M. Dyke
Organization
CGAL Project
Non-rigid Iterative Closest Point
Non-rigid Iterative Closest Point (N-ICP) is a classic method used for the registration of non-rigidly deforming shapes. Non-rigid registration seeks...
Contributor
rp01052
Mentor
Mael
Organization
CGAL Project
Geodesic Distance Computation Improvements
The goal of the project is to add the "Virtual Source Propagation" (Trettner, Bommes, Kobbelt 2021) algorithm to CGAL. This algorithm finds...
Contributor
Jeffrey.D.Cochran
Mentor
sloriot
Organization
CGAL Project
Continous-Time Collision Detection for CGAL
Funded by GSoC this summer, I propose to add collision detection to CGAL in a way that naturally builds on and extends CGAL’s existing AABB-tree...
Contributor
Deniz Diktas
Mentor
Efi Fogel
Organization
CGAL Project
Demonstrating 2D Arrangements Embedded on the Sphere
Abstract: Recently the "2D Arrangement" package of CGAL has been enhanced with the support of 2D arrangement of geodesic arcs embedded on the sphere....
Contributor
Ivan Paden
Mentor
sloriot, Jane Tournois
Organization
CGAL Project
Curvature Adaptive Remeshing
The goal of the proposed project is to extend the existing remeshing functionality in the polygon mesh processing (PMP) package with the adaptive...