[Boost-users] CGAL and the BGL

From: Andreas Fabri (andreas.fabri_at_[hidden])
Date: 2007-06-02 09:11:54

The CGAL Open Source Project is pleased to announce the release 3.3 of
CGAL, the Computational Geometry Algorithms Library, a robust,
easy-to-use, and efficient C++ software library of geometric data
structures and algorithms.

We don't post the full announcement here, because that would be
off-topic, but we want to point out that CGAL comes with partial
specializations of the boost::graph_traits for several CGAL data
structures and overloaded versions of the global functions for
graph traversal.  This is done for the 2D triangulations, the 2D
arrangements of curves, and the polyhdral surface, that is for
data structures with vertices and edges.

This allows for example to compute the Euclidean minimum spanning tree
of a point set in the plane, by running the BGL minimum spanniung tree
algorithms on a  CGAL 2D Delaunay triangulation, without converting
the latter to a BGL graph.

For more iformation see
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html#Pkg:BGL