On Sun, Oct 5, 2008 at 3:51 AM, Benjamin M. Schwartz <[EMAIL PROTECTED]> wrote: > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > I have written up an algorithm for quasi-optimal placement of items in the > Mesh View. It involves linear algebra. I have actually implemented it, > in less than 100 lines of python. It is described here: > > http://wiki.laptop.org/go/Circle_positioning_algorithm > > Implementation: > > http://dev.laptop.org/~bemasc/discus.py > > I am not sure whether this algorithm is of use for Sugar.
To determine so, I'd make some questions: - how it compares with the existing implementation functionality-wise? - and performance-wise? - which dependencies eliminates or brings? how heavy are them? Thanks, Tomeu _______________________________________________ Sugar mailing list Sugar@lists.laptop.org http://lists.laptop.org/listinfo/sugar
