Thanks for sharing, that's a beautiful video.

I remember Ralph saying that some of his students were interested in  
3D programming interfaces; this could be a very nice tool.  How long  
does it take to compute the spanning tree?  How long does it take for  
Walrus to visualize it (did it have to do much precomputation before  
viewing)?

Best,
Josh


On Mar 13, 2007, at 4:54 PM, Craig Latta wrote:

>
> Hi--
>
>      Well, I broke down and wrote some code to calculate a non-cyclic
> spanning tree for an object memory reference graph, so now I can use
> Walrus[2] for visualization. It's nice! Check out the demo movie I  
> made
> (in small[3] and original[4] versions).
>
>      This could be the basis of an extremely powerful extension to the
> interpreter simulator; I assume it'd be a fun Croquet project. Alan
> Lovejoy suggested the name "Nexus"; I like it. More to come...
>
>
>      thanks,
>
> -C
>
> [1] http://netjam.org/spoon
> [2] http://www.caida.org/tools/visualization/walrus
> [3] http://tinyurl.com/2akd83 (movedigital.com)
> [4] http://tinyurl.com/33gah7 (movedigital.com)
>
> -- 
> Craig Latta
> improvisational musical informaticist
> www.netjam.org
> Smalltalkers do: [:it | All with: Class, (And love: it)]
>
>