[Yt-dev] tree code for boundedness

[Stephen Skory]

Hi all,

I've been working with the clump finder, and am becoming impatient with the gravitationally bound test calculation. I'm a very important person! Ok, sorry, I'm back to serious now. I'm wondering if we think that implementing some kind of tree code or pixelation of cells to lower resolution levels would be practical and accurate enough? It would make the double loop much smaller and quicker, and there could be a single user-controlled parameter that sets the desired accuracy. There are even parallel tree codes out there that we may be able to crib from.

Any thoughts would be appreciated!

 
Stephen Skory
stephenskory at yahoo.com
http://stephenskory.com/
510.621.3687 (google voice)