kD-tree for particles onto grids
Hi Stephen (et al), I'm interested in taking particle-only data and putting it into a regular, multi-level grid structure that has yet to be created. I think using a kD-tree, where we specify a maximum number of particles in a given region, could be used to identify regions that should be covered by grids. Do you think that your kD-tree code would be suitable for this? -Matt
Matt,
I'm interested in taking particle-only data and putting it into a regular, multi-level grid structure that has yet to be created. I think using a kD-tree, where we specify a maximum number of particles in a given region, could be used to identify regions that should be covered by grids. Do you think that your kD-tree code would be suitable for this?
Sure, you'd have to write some kD-tree grid data access functions. But it shouldn't be too difficult. It also currently has the number of points per bucket hard-wired at 12, so that would have to be changed into an input parameter. _______________________________________________________ sskory@physics.ucsd.edu o__ Stephen Skory http://physics.ucsd.edu/~sskory/ _.>/ _Graduate Student ________________________________(_)_\(_)_______________
Sure, you'd have to write some kD-tree grid data access functions. But it shouldn't be too difficult. It also currently has the number of points per bucket hard-wired at 12, so that would have to be changed into an input parameter.
Hi Stephen, Cool. So do you think that we could get the location of the bounding boxes for each finalized bucket, following the construction of the tree? I'm still new to Forthon, so do you think you could help out a bit with this? -Matt
Matt,
Cool. So do you think that we could get the location of the bounding boxes for each finalized bucket, following the construction of the tree? I'm still new to Forthon, so do you think you could help out a bit with this?
Sure, it won't take me too long. Is it *only* the corners of the final buckets you care about, not the intermediate tree nodes? _______________________________________________________ sskory@physics.ucsd.edu o__ Stephen Skory http://physics.ucsd.edu/~sskory/ _.>/ _Graduate Student ________________________________(_)_\(_)_______________
Hi Stephen, If we can get the intermediate nodes -- so that we have a full hierarchy, like in standard AMR -- that would be the best. But if we cannot, I think that it can be reconstructed, right? -Matt On Wed, Jul 15, 2009 at 11:24 AM, Stephen Skory<stephenskory@yahoo.com> wrote:
Matt,
Cool. So do you think that we could get the location of the bounding boxes for each finalized bucket, following the construction of the tree? I'm still new to Forthon, so do you think you could help out a bit with this?
Sure, it won't take me too long. Is it *only* the corners of the final buckets you care about, not the intermediate tree nodes? _______________________________________________________ sskory@physics.ucsd.edu o__ Stephen Skory http://physics.ucsd.edu/~sskory/ _.>/ _Graduate Student ________________________________(_)_\(_)_______________
_______________________________________________ Yt-dev mailing list Yt-dev@lists.spacepope.org http://lists.spacepope.org/listinfo.cgi/yt-dev-spacepope.org
participants (2)
-
Matthew Turk -
Stephen Skory