I’m trying to take data that is irregularly spaced data (say V(x,y,z) where x, y, and z are some floating point coordinates) and find what the value of the data is on a Cartesian coordinate system ( say V(x’, y’, z’) where x’, y’, and z’ integers coordinates)
Now using a texture this is quite straight forward to take regularly spaced data and interpolate it onto whatever coordinates you want, but the opposite situation is not so apparent to me. Maybe using some type of sorting to know how many data points are proximal (euclidean norm?) to a grid point, and manually interpolating from there? Or using some sort of triangulation like qhull does (is there a qhull for CUDA?)?
I’m not sure the best way to go about it. I’m sure somebody’s done it, and I really don’t want to reinvent the wheel here.