2 Apr
2010
2 Apr
'10
12:13 a.m.
On 2 Apr 2010, at 00:03, Lukas Renggli wrote:
Julien used it in his back-in-time debugger to visualize flow of data
in a (potentially large) graph of objects.
I knew about the fisheye view layout for trees, but I did not know
about the minimal crossing algorithm. Do you have more details?
Also an efficient spring layout with edges
that automatically avoid nodes and that are optimized for minimal
crossings was implemented by Julien Fierz and part of the code at
some
point in time.
I did not know this one. Also the original Squeak/Pharo code had anti-aliasing.
I think that Alex wanted to say to implement anti-aliasing fast.
Cheers,
Doru
Lukas
--
Lukas Renggli
www.lukas-renggli.ch
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
www.tudorgirba.com
"Every successful trip needs a suitable vehicle."