Last 10 changes peermore peermore peermore aboutchris augury socialtext pictures socialtext socialtext aboutchris 122 words 253 defs | lookRevision: | Date: Fri, 08 Mar 2002 09:53:29 -0800 From: Sandy Klausner <klausner@coretalk.net> Reply-To: ba-ohs-talk@bootstrap.org To: ba-ohs-talk@bootstrap.org Subject: Re: [ba-ohs-talk] spring and force directed graphs Chris, Check out http://www.ontologystream.com/SLIP/index3.htm Sandy [snip from my posting to this list] > Can people point me to information that has been helpful in their own > investigations of designing, programming and using algorithms for > drawing graphs? I'm especially interested in: > > - overviews of the reasoning used in designing these sorts of > algorithms > - design pointers for internal and external data representations of > graphs. The current system does use XML for input, but the format is > basically a wrapper around a matrix so does not represent node > interconnections easily, nor cleany allow for additions of new > nodes, or new attributes on nodes. I've seen and liked what > Touchgraph for the Link Browser uses. > - transmission formats > - [important stuff I'm not thinking about at the moment] > > What I'd like to have at the end of this is a system that allows for > the display of similarity matrices and clustering in the same display. > Clusters are displayed in the network and when selected can be zoomed > for detail of their contents. > > This is more math than I know at the moment, but I guess I'll be > picking it up. | [ Contact ] [ Old Blog ] [ New Blog ] [ Write ] [ AboutWarp ] [ Resume ] [ Search ] [ List Words ] [ Login ] |