Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • $\begingroup$ Thank you very much. The book you mentioned is not available, but I have got the direction. Without the book it may be even better. $\endgroup$ Commented Feb 28, 2013 at 13:39
  • $\begingroup$ If you want to see the routines in Haneberg's book, you can download them here. It seems to be called ReciprocalDistanceGrid[] in the book, tho. Looking at the implementation, it seems to me that one can now implement this in a less cumbersome manner using Nearest[]. $\endgroup$ Commented Apr 24, 2013 at 0:09
  • $\begingroup$ Thanks! The implementation I had was much quicker (and using Nearest) but I think that the obtuse package is a superset of that. It includes other algorithms and seems to be much quicker. Having looked around, I'd say it's the most complete collection of gridding algorithms for mathematica for irregularly spaced data. Inverse distance is definitely not as good as thin plate splines but much quicker for larger datasets. $\endgroup$ Commented Jun 4, 2013 at 11:07