Jane Tournois
de1369d8ec
when the c3t3 contains no cells after initialization by features, it may be needed to add more points for initialization, even when the nb of facets in complex is > 0 It is the case for example when facets cover a very small part, or too few connected components of the domain
The Computational Geometry Algorithms Library (CGAL) is a C++ library that aims to provide easy access to efficient and reliable algorithms in computational geometry.
CGAL Releases
The primary vector of distribution of CGAL are source tarballs, released twice a year, announced on the web site of CGAL.
Getting Started with CGAL
Since version 5.0, CGAL is a header-only library, meaning that it is no longer needed to build CGAL libraries before it can be used.
Head over to the CGAL manual for usage guides and tutorials that will get you started smoothly.
License
See the file LICENSE.md.
CGAL Git Repository Layout
The Git repository of CGAL has a different layout from release tarballs. It
contains a CMakeLists.txt file that serves as anchor for configuring and building programs,
and a set of subfolders, so called packages. Most packages
implement a data structure or an algorithm for CGAL (e.g., Convex_hull_2,
or Triangulation_3); however some packages serve special needs:
Installation- meta-files and CMake-supportMaintenance- infrastructural supportCore,CGALimageIO,Qt_widget,GraphicsView- component librariesScripts- scripts to simplify developer's and user's workTestsuite- infrastructure for testsuiteDocumentation- infrastructure for CGAL's manualSTL_Extension- extensions to the standard template library