On Wednesday 28 January 2009 15:09:26 Konrad Hinsen wrote: > It is possibe to generalize the Fast Multipole Method somewhat, but > it remains a technique for a limited (though important) class of > interactions.
I disagree. The most obvious generalization of FMM (and the one presented in my books OCaml for Scientists and F# for Scientists) is the hierarchical spatial decomposition of general contributions rather than just poles. That category of methods is huge, encompasses many of the most important algorithms ever invented and is applicable to most physical simulations, most notably heterogeneously distributed ones. Moreover, the inherent ability of these methods to attain a required accuracy efficiently also makes them ideally suited for games programming where physical accuracy is traded for soft real-time performance. > It is rather unlikely that it will be of any use for simulating a flock of > birds. People are using FMM for flocking: http://www.itk.ilstu.edu/faculty/portegys/research/ptree-PDPTA03.pdf http://litis.univ-lehavre.fr/~tranouez/publications/Cossom2007-LITIS-DutotTranouez.pdf -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
