CGAL users discussion list

[Efi Fogel <>]

I assume that you have looked at the example bgl_dual_adapter.cpp. It uses an instance of the CGAL::Dual<Arrangement_2> class template. This instance is not a new data structure, but an adapter. It adapts the arrangement in memory to the Breath First Search of the BGL by providing the necessary interface. What you need to do is adapt the adapter to the your needs. For example, the iterator over the vertices of the graph (the faces of the arrangement) should skip those faces that you are not interested in.

On Mon, Jan 30, 2012 at 3:13 PM, pgiitu <> wrote:

Hi,

I am working on a project in which I require to do Breadth First Search on
the faces of an arrangement. CGAL using BGL provides support for making a
dual graph of a given arrangement. However, in that dual graph I don't
require few faces.

So, the problem is that I need to make a dual graph of certain specific
faces of an arrangement. I dont know how to remove certain faces from the
dual graph of an arrangement.



--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/Arrangement-to-Dual-Graph-tp4340937p4340937.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss