Logo C Logo G Logo A Logo L
[Computational Geometry Algorithms Library]
[Information]
[Software]
[What's new]
[Other sites]
[Members]
[Home]
The CGAL project is a collaborative effort to make the large body of geometric algorithms developed in the field of computational geometry, available for applications, mainly by constructing a robust, efficient, general, and easily maintainable C++ software library of geometric algorithms.

The project is funded by European Union's information technologies programme ESPRIT, as Project 21957 - CGAL. It is a joint initiative of Utrecht University (The Netherlands), ETH Zurich (Switzerland), Free University Berlin (Germany), INRIA Sophia-Antipolis (France), RISC Linz (Austria), Tel Aviv University (Israel) and


Many of these sites were involved in the ESPRIT III BRA project ALCOM II, in which a large library of data structures and combinatorial algorithms has been developed at Max-Planck-Institute for Computer Science. This library, LEDA (Library of Efficient Datatypes and Algorithms), is now widely used at companies, research institutions, and universities.

Local coordination at Max-Planck-Institute: Stefan Schirra


Last modified on 20 April 1998