@Jonzingale. I think you are talking about the Cellular Potts page. The code for it is on Github, https://github.com/m0ose/onepagers/blob/master/potts2.html. I spent a lot of time tweaking values and just staring at that model. I don't know enough about DLA to make a good comparison. Maybe it is similar in the way it randomly chooses a move whether it can perform the move or not.
@Angel Edward <an...@cs.unm.edu>. Here is Owen's homework assignment from back in 2011 for your class, http://backspaces.net/CS591/hw3/hw3.html <http://backspaces.net/CS591/hw3/hw3.html>. Cody Smith On Mon, Mar 1, 2021 at 9:35 AM jon zingale <jonzing...@gmail.com> wrote: > *Note that this is really slow. Is there a higher performance version of > this algorithm?* Cody, This statement piqued my interest. Is there > somewhere I can see your code? If this algorithm is anything like *diffusion > limited aggregation* (which at a glance it likely might be) then I > suspect there really are not good optimizations that preserve structural > clarity. Anyway, I am interested. > ------------------------------ > Sent from the Friam mailing list archive > <http://friam.471366.n2.nabble.com/> at Nabble.com. > - .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. . > FRIAM Applied Complexity Group listserv > Zoom Fridays 9:30a-12p Mtn GMT-6 bit.ly/virtualfriam > un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com > FRIAM-COMIC http://friam-comic.blogspot.com/ > archives: http://friam.471366.n2.nabble.com/ >
- .... . -..-. . -. -.. -..-. .. ... -..-. .... . .-. . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn GMT-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: http://friam.471366.n2.nabble.com/
