[Yt-dev] kD-tree for particles onto grids

Matthew Turk matthewturk at gmail.com
Wed Jul 15 08:25:31 PDT 2009


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 at 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 at physics.ucsd.edu o__ Stephen Skory
> http://physics.ucsd.edu/~sskory/ _.>/ _Graduate Student
> ________________________________(_)_\(_)_______________
>
> _______________________________________________
> Yt-dev mailing list
> Yt-dev at lists.spacepope.org
> http://lists.spacepope.org/listinfo.cgi/yt-dev-spacepope.org
>



More information about the yt-dev mailing list