CGAL (passed)

This edition is dedicated to “Designing robust geometric algorithms with CGAL.org” (Computational Geometry Algorithm Library) It will be hosted by Marc Pouget, researcher in the Gamble team.

➡️ What is CGAL?

CGAL is a software project that provides easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as geographic information systems, computer aided design, molecular biology, medical imaging, computer graphics, and robotics.

The library offers data structures and algorithms like triangulations, Voronoi diagrams, Boolean operations on polygons and polyhedra, point set processing, arrangements of curves, surface and volume mesh generation, geometry processing, alpha shapes, convex hull algorithms, shape reconstruction, AABB and KD trees…

➡️ Prerequisite: * Knowledge of C++ * CGAL installed * Have downloaded the CGAL examples: https://github.com/CGAL/cgal/releases/download/v5.3.1/CGAL-5.3.1-examples.tar.xz

✅ Using CGAL on Unix (Linux, macOS, …) https://doc.cgal.org/latest/Manual/usage.html#secusingpkgman

Recommandations :

• use a package manager :

  • linux: sudo apt-get install libcgal-dev
  • mac : brew install cgal

• with sources :

  • download lib CGAL 5.3.1 from : https://github.com/CGAL/cgal/releases
  • make
  • sudo make install

✅Using CGAL on Windows (with Visual C++): https://doc.cgal.org/latest/Manual/windows.html

Advanced users may want to build the demo (in the “demo”) directory, then third party libraries must be installed, in particular Qt5.