CGAL users discussion list

[Ophir Setter <>]

The face iterator goes in random order.

If you want to use spanning tree on the dual graph then do exactly that. Use the adaptation to BGL to receive a BGL graph of the dual arrangement, and use one of boost algorithms for spanning trees.

On Jul 20, 2011 3:34 PM, "Pierre Cagne" <> wrote:
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> Hi,
>
> One simple question (I found no answer to it in the doc) : how is implemented a Face_iterator for a Arrangement_2<Traits_2,Dcel> ? Does the iteration proceed on a spanning tree of the dual graph ?
>
> Actually, I need to work on a spanning tree of the dual graph of an arrangement graph. So, before to do what is already done...
>
>
> Thankfully.
>
> - - --
> Pierre Cagne
> Etudiant à l'Ecole Normale Supérieure de Paris
>
> -----BEGIN PGP SIGNATURE-----
> Version: GnuPG/MacGPG2 v2.0.17 (Darwin)
> Comment: GPGTools - http://gpgtools.org
>
> iQEcBAEBAgAGBQJOJsr4AAoJEDvbEuRh0dEX4XIH/3+nHTMLXve429wUhTsCYhRo
> jF82uHciQf+7mGH+8Gr7wdFFY6O/2qra46ZcWCGMR2jixElk9wQj4ly9faA+VXxA
> aPOAvN9Wk9cAWJGZhZePuc0K4trR/uwuyr18UDfRk9qliKKPabTtZPS/R2gkKCEQ
> PkbnFW/0x/NqdsULTYkUiew3Zc5QMDh2edAKm+auNqBehpmAeVwi2ZQ3Uq8GLc7b
> fTSeMQF6inLKfe2TEp9Cn5rtUF5ZuSv6Kb9ZcPey1ckPCmfIGhu1hoASikq7lHOU
> z7qYIZA091LGBGt+067ZM32ksQotx7gDtQ4tzMl+MBXPDKWU4aEdCpCLagXuEio=
> =b9Tn
> -----END PGP SIGNATURE-----
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>