Tutorial Documents

We list several tutorials that may be useful in getting to know CGAL. These tutorials were typically presented at specific events. You may find here the corresponding talk slides, other printed materials, and example programs. Some of the material might be outdated over time and might not work immediately with the latest CGAL release. You can also also check out the videos.

Comments are always welcome and may be directed to the authors of the documents or here.

• 2012: Solving problems with CGAL: an example using the 2D Apollonius graph package
  Menelaos Karavelas.
  Presented at the Minisymposium on Publicly Available Geometric/Topological Software, part of the Computational Geometry Week, including ACM SoCG 2012, June 17-20, in Chapel Hill, NC, USA.
  Abstract and slides in pdf, Example in a Gzipped tarball.
  
  
• 2008: SIGGRAPH 2008 Course
  Pierre Alliez, Andreas Fabri and Efi Fogel.
  
  
• 2004: A Tutorial on CGAL Polyhedron for Subdivision Algorithms
  Le-Jeng Shiue, Pierre Alliez, Radu Ursu and Lutz Kettner.
  Presented at the second CGAL User Workshop, New York, 2004, and the second Symposium on Geometry Processing, Nice, France, 2004.
  Slides, papers, and example programs are available from the Polyhedron Tutorial Page.
  
  
• 2001: Implementing Geometric Algorithms - LEDA and CGAL
  Susan Hert and Kurt Mehlhorn.
  Presented at the Sixth ACM Symposium on Solid Modeling and Applications, Ann Arbor, Michigan, 2001.
  Slides available as PDF.
  
  
• 1999: Tutorial I: Programming with CGAL
  Lutz Kettner.
  Presented at the 15th Annual Symposium on Computational Geometry, Miami, Florida, 1999.
  Available are slides in PostScript and slides and example program in a Gzipped Tar-ball.