I have a 3D space (x, y, z) with an additional parameter at each point (energy), giving 4 dimensions of data in total.
I would like to find a set of x, y, z points which correspond to an iso-energy surface found by interpolating between the known points.
The spacial mesh has constant spacing and surrounds the iso-energy surface entirely, however, it does not occupy a cubic space (the mesh occupies a roughly cylindrical space)
Speed is not crucial, I can leave this number crunching for a while. Although I'm coding in Python and NumPy, 开发者_如何转开发I can write portions of the code in FORTRAN. I can also wrap existing C/C++/FORTRAN libraries for use in the scripts, if such libraries exist.
All examples and algorithms that I have so far found online (and in Numerical Recipes) stop short of 4D data.
There are quite a few options here...
In order to get your energy into your mesh, you'll need to use some form of interpolation. Shepard's method is a common, and reasonably simple, method to implement, and tends to work well if your data distribution is reasonable.
Once you have that done, you'll need to do some form of isosurface generation.
There are some libraries out there to make this easy. Most notably, VTK includes python wrappers and has all of the tools required to do both of these steps.
For details on how this could be done in VTK, you can check vtkShepardMethod and vtkContourFilter.
Since you have a spatial mesh with constant spacing, you can identify all neighbors on opposite sides of the isosurface. Choose some form of interpolation (q.v. Reed Copsey's answer) and do root-finding along the line between each such neighbor.
Why not try quadlinear interpolation?
extend Trilinear interpolation by another dimension. As long as a linear interpolation model fits your data, it should work.
精彩评论