[yt-dev] Matching points to grids

[Matthew Turk]

Hi John,

That's the ideal way, but we don't yet have the code to do that.  I
would like to do that.  The fastest method would be to create a new
version of find_values_at_points (which accepts an array) and make itj
ust return grid indices.  This would do the NxM collision check of
particles in grids.

Writing an octree-aware particle finder would be a good idea.
Necessary, even...

-Matt

On Fri, Nov 16, 2012 at 1:07 PM, John ZuHone <jzuhone at gmail.com> wrote:
> I did know about that, but given, say, a million points, would that be
> *fast*? I need to look at what it does I guess.
>
> In FLASH, what'd we'd normally do is start at the top level and traverse
> down the octree until we found the block.
>
> On Nov 16, 2012, at 1:02 PM, Nathan Goldbaum <nathan12343 at gmail.com> wrote:
>
> Hi John,
>
> Yes, you can use pf.h.find_point() to do that.  There's some documentation
> on it here:
> http://yt-project.org/doc/analyzing/low_level_inspection.html#finding-data-at-fixed-points
>
> -Nathan
>
> On Nov 16, 2012, at 10:00 AM, John ZuHone wrote:
>
> Hi all,
>
> Do we have anything in yt right now that, given a set of points, *quickly*
> finds out which grids they belong to?
>
> Best,
>
> John Z
> _______________________________________________
> yt-dev mailing list
> yt-dev at lists.spacepope.org
> http://lists.spacepope.org/listinfo.cgi/yt-dev-spacepope.org
>
>
> _______________________________________________
> yt-dev mailing list
> yt-dev at lists.spacepope.org
> http://lists.spacepope.org/listinfo.cgi/yt-dev-spacepope.org
>
>
>
> _______________________________________________
> yt-dev mailing list
> yt-dev at lists.spacepope.org
> http://lists.spacepope.org/listinfo.cgi/yt-dev-spacepope.org
>