That is weird. Unfortunately I don't have a 64bit OS to test it. Processing JS is just a parser that parses processing (java) code and runs it as JS. I tried to write everything in JS but its major pain in the butt, since js has very weird way of doing classes (they are not even called classes). However, the parsing is done once when the code is loaded, so shouldn't affect the performance. My guess is that 64bit linux Firefox has some js issues. How does it handle intensive JS computations like :
http://www.chiptune.com/starfield/starfield.html Btw, I finished the rudimentary version of the live editor. http://www.math.uiuc.edu/~rkirov2/processing/grapheditor_live.html Click the "live" checkbox to see the vertices rearrange is real time. My implementation is quite simplistic (no real physics here). I am also trying to make vertices repel each other (not done yet). I would like to see a good reference on how to handle graph viz in real-time if anyone has something. Not sure if this project can ever be made stable/mainstream enough be bundled with SAGE (it won't work with IE for example). However even at the moment the website, itself has the capability (with a bit of copy/ pasting) of "linking" up with SAGE, to make the construction/ visualization of a simple graphs easier. Hopefully, it can help some graph theorists. Rado On May 8, 12:39 am, Rob Beezer <goo...@beezer.cotse.net> wrote: > Looking real good. I like the red edges prior to deletion when you > drag outside the canvas. > > I've now run this on two machines - one is 32-bit, one 64-bit. > Otherwise pretty much the same - recent Firefox on KUbuntu, approx > 3GHz chips. The editor is very crisp and robust on the 32-bit > machine. On 64-bit it used to be somewhat painful to use and drag-and- > trash wouldn't even work, while this version seems a bit faster, but > still is much, much slower than the excellent performance on 32-bit. > > Any thoughts? Is this JSProcessing, or maybe just Javascript? Let me > know if there is more specific info I can provide. > > Rob > > On May 7, 6:08 pm, Rado <rki...@gmail.com> wrote: > > > New version is up: > > >http://www.math.uiuc.edu/~rkirov2/processing/grapheditor.html > > > The short changelog: > > 1) By popular demand, when you drag a vertex out of the page the edges > > turn red to indicate you are going to lose it and it is not erased > > until you release the button. > > 2) There is an accompanying python script which preps ups the graph > > data in JS format for easy copy/paste to get the same graph in the > > editor. > > 3) The edges of the selected vertex are now blue. This is just a > > visual clue. > > > Rado > > > On May 5, 2:52 pm, rjf <fate...@gmail.com> wrote: > > > > On May 5, 10:53 am, Andras Salamon <andras.sala...@comlab.ox.ac.uk> > > > wrote: > > > ..... > > > > > I thought papers like your > > > > http://www.eecs.berkeley.edu/~fateman/papers/graphing7.pdf > > > > were highly appropriate for the Graph Drawing symposium? > > > > http://facweb.cs.depaul.edu/gd2009/gd2009.asp > > > > (Submission deadline is 31 May 2009.) > > > > > Or is that one of the "upgraded" venues? > > > > Thanks for the suggestion. > > > > These people are doing very sophisticated things in laying out graphs, > > > and have a substantial history of algorithm development, competition > > > in a set of benchmarks, etc. My contribution would be to say "I wrote > > > this relatively naive program, using a graphics toolkit, in the > > > programming language Lisp, so it can be called from a computer algebra > > > system". > > > > Since it's not advancing the art of graph display, I would not expect > > > it to be of interest. > > > > Something notable about it is that it's under 300 lines of code. > > > > Probably not a winner for this conference :) > > > RJF > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
