aacovski
aacovski
@dbrakenhoff First off, apologies for overlapping with your work... searchsorted (structured) and kdtree (vertex, unstructured) in my PR already provides 1:1 point-to-cell mapping - each query point returns exactly one...
I'd recommend optimizing the existing `Grid.intersect(x, y)` methods rather than adding new APIs. `MultiPoint` is slow. The optimization could use `scipy.spatial.cKDTree` on cell centroids: 1. Query k-nearest cells via KDTree...
may be addressed in #2646