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.

Current Version:   2.1 License Type:   Free for Academic Research and Teaching Purposes, Commercial License Available

Home Site: http://www.cs.uu.nl/CGAL/ http://www.algorithmic-solutions.com/ (Commercial License) Source Code Availability:   Yes Available Binary Packages: Debian Package:   No RedHat RPM Package:   No Other Packages:   No Targeted Platforms: C++ platforms, CGAL supports Linux/g++ Software/Hardware Requirements: C++ compiler

Other Links: None Mailing Lists/USENET News Groups: None User Comments: None See A Screen Shot? (Not Yet)

  SAL Home   |   Computer Graphics, Images & Signals   |   Misc