CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Hello Mattia,

Conceptually I have a problem defining a graph on a data structure which
is documented as a point set on which you can do queries. I mean that
there is no notion of graph on the structure, whereas there is an
obvious one on triangulation.

Can you try using the following specialization of graph_traits 
boost::graph_traits<Point_set<Gt,Tds>::Base> instead of
boost::graph_traits<Point_set<Gt,Tds> > in your code and tell us whether
it is working?

I know that Base is not documented, I will investigate why.

S.


mattia.penati wrote:
> I'm working with the package "2D Range and Neighbor Search" and I think it
> could be a good idea to interface this package with Boost Graph. Currently
> you could not use the structure Point_set_2 with Boost Graph although it is
> a Delaunay_triangulation_2. For this reason I write my own header (attached
> to this message) for this purpose. It's quite simple to use, it must be
> copied inside CGAL/boost/graph directory.
>
> http://cgal-discuss.949826.n4.nabble.com/file/n3356516/graph_traits_Point_set_2.h
> graph_traits_Point_set_2.h 
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/2D-point-sets-and-Boost-Graph-tp3356516p3356516.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.