CGAL users discussion list

[Peter Schröder <>]

Folks,

I am using Polyhedron_3 for algorithms on simplicial surface meshes 
(arbitrary topology with/without boundary). I need to generate a system 
of loops and want to use the tree/co-tree algorithm as described by 
Erickson and Whittlesey. It occurred to me that I should use the Boost 
graph library for this since Boost is already part of CGAL anyway (in 
other words: no additional library to install...).

As usual when looking at a whole new library things are a bit 
overwhelming in terms of getting started. If someone has an example of 
using Polyhedron_3 as an underlying "graph" to run graph algorithms on 
using the Boost graph algorithm library that would be most helpful for 
me in terms of accelerating my getting started with this.

What do I actually need? I need to run Dijkstra from what will be the 
base point of the system of loops. Then run a maximum spanning tree 
algorithm on the dual of the *remaining* edges (those not in the 
Dijkstra tree). Finally I need to find the remaining 2g edges which are 
neither in the Dijkstra tree nor in the maximum spanning tree and create 
the loops by connecting the corresponding branches of the Dijkstra tree 
with the endpoints of each one of these 2g edges. (and then cut and live 
happily ever after... :))

Any example along the lines of some subset of the above will likely 
allow me a jump start on getting rolling with this.

Thanks much!

peter