CGAL - Constructing a Geometric Algorithms Library
Sprache der Bezeichnung:
Englisch
Original Kurzfassung:
Computational Geometry Algorithms Library (CGAL)
CGAL is a Computational Geometry Algorithms Library written in C++, developed by a consortium consisting of ETH Zürich (Switzerland), Freie Universität
Berlin (Germany), INRIA Sophia-Antipolis (France), Martin-Luther-Universität Halle-Wittenberg (Germany), Max-Planck Institut für Informatik,
Saarbrücken (Germany), RISC Linz (Austria) Tel-Aviv University (Israel), and Utrecht University (The Netherlands). You find more information on the
project on the CGAL home page (http://www.cs.ruu.nl/CGAL).
The CGAL project is a collaborative effort to develop a robust, easy to use,
and efficient C++ software library of geometric data structures and algorithms.
The CGAL library contains:
- Basic geometric primitives such as points, vectors, lines,
predicates such as for relative positions of points, and
operations such as intersections and distance calculation.
- A collection of standard data structures and geometric algorithms,
such as convex hull, (Delaunay) triangulation, planar map,
polyhedron, smallest enclosing circle, and multidimensional query
structures.
- Interfaces to other packages, e.g. for visualisation, and I/O, and
other support facilities.
Sprache der Kurzfassung:
Englisch
Englische Bezeichnung:
Constructing a Geometric Algorithms Library (CGAL)