[Boost-users] BGL Question: embedded graph with faces

From: Andreas Fabri (andreas.fabri_at_[hidden])
Date: 2007-01-29 08:06:41

Hello,

Does anybody work on extending the graph concept hierarchy of the BGL
in order to deal with graphs that are embedded, that is the edges
which are adjacent to a vertex are ordered consistently, and if you
go from an edge to the successor edge at a vertex you walk along a
face. Maybe even another graph concept where the faces can have
holes.

I ask because we already write graph traits specializations for
the polyhedral surface of CGAL, which uses a halfedge data structure,
and I don't want to reinvent the wheel in case all the terminology
is already existing, and I only haven't found it yet.

Thanks in advance,

andreas