-
Notifications
You must be signed in to change notification settings - Fork 32
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Bilinear Remapping #678
Comments
@hongyuchen1030 This is my general idea for the remapping logic. |
@philipc2 Depending on how we find the subset of polygons we might not use the tree structures at all, right? Except I suppose for the situation where the point is not in a polygon in the dual mesh, but one in the primal. Does our subsetting use tree structures at all? |
I am curious for this PR:#938 If this is what I think it is doing, assigning each side of an edge a sign to see which side is within the given face, then we're basically doing a mesh-arrangement. And if we are doing mesh-arrangement, we don't need to do a brute force test about if a point is inside a given face |
@hongyuchen1030 the algorithm will end up using ball tree, so it will be constructed before the call to point in polygon. |
Proposed new feature or change:
Implement bilinear remapping in UXarray. Good paper here by David Marsico and Paul Ullrich.
The text was updated successfully, but these errors were encountered: