Re: [igraph] Circular Reingold Tilford on tree is not planar!?

[Gábor Csárdi]

Rob,

it should be planar, AFAIK. If it is not planar, that means that the
original non-circular one is not planar, the circular one is just the
transformation of that. Can you send us (in private if it's big, to
Tamas and me) an example? I think this is a bug.

Best,
Gabor

On Fri, Jun 24, 2011 at 9:55 AM, Robert Belleman <address@hidden> wrote:
> Hi,
>
> I am applying the circular Reingold Tilford layout algorithm on a tree
> consisting of 23k nodes and the same number of edges. I was expecting this
> algorithm to produce a planar layout but it doesn't.
>
> Can anybody enlighten me?
>
> Thanks,
> -- Rob
>
> --
> Robert Belleman, PhD, Computational Science, Faculty of Science
> Universiteit van Amsterdam, Science Park 904, 1098 XH Amsterdam
> The Netherlands.    T: +31 20 525 7272/7463  F: +31 20 525 7490
> W: http://www.science.uva.nl/~robbel/    E: address@hidden
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI