Dear @AndersMS Thanks for your detailed replies. I think there are only two outstanding points in those you have answered.
**18**: Now I understand what you mean, thanks. To make this clearer to myself, I would say something like this: Bounds interpolation uses the same tie point index variables and therefore the same tie point cells as coordinate interpolation. One of the vertices of each coordinate tie point cell as chosen as the bounds tie point for the cell. For 1D bounds, the vertex chosen is the one which is on the side closer to the boundary of the interpolation subarea. For 2D bounds, the vertex chosen is the one which is closest to the boundary of the interpolation subarea, considering all the interpolated coordinates together, or in other words, the one closest to the corner of the interpolation subarea. Are you restricting the consideration of 2D bounds to rectangular cells, or are polygons of _n_ vertices allowed? **27**: I think the key point is that you mean _three-dimensional_ Cartesian interpolation. I didn't think of that. If you could clarify this, it would be fine. Cheers Jonathan -- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://urldefense.us/v3/__https://github.com/cf-convention/cf-conventions/issues/327*issuecomment-886687324__;Iw!!G2kpM7uM-TzIFchu!iEy4S2WEt_kU5_OoPHE9-yyJcgP-l8nMW5sdOcoONKxT3tVZLZ5Q8jC-27FnuTaoo6nVAuGz0IE$ This list forwards relevant notifications from Github. It is distinct from [email protected], although if you do nothing, a subscription to the UCAR list will result in a subscription to this list. To unsubscribe from this list only, send a message to [email protected].
