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*

8
  • $\begingroup$ Note that the above method missed at least one extremum @ coordinates $\approx$ {0,55} as it does not properly account for the periodicity of the field. $\endgroup$ Commented Aug 27, 2012 at 21:38
  • $\begingroup$ Do you mean GaussianRandomField in the question (which was slow) or the improved addendum in your answer? I think you mean the latter, in which case you can link to it directly... $\endgroup$ Commented Aug 27, 2012 at 21:45
  • $\begingroup$ @R.M I guess for this example speed does not matter. I don't know how to link to a subsection of a question. $\endgroup$ Commented Aug 27, 2012 at 21:50
  • 1
    $\begingroup$ In using ListInterpolate you introduced certain smoothness to your data which comes with the interpolation scheme. While you used this to get a function which you can derivate this maybe covers some critical points. Why don't you stay on your discrete data and check the huge amount of literature about extreme/sattle point finding algorithms? As an example maybe see this paper here. $\endgroup$ Commented Sep 3, 2012 at 3:34
  • 1
    $\begingroup$ @chris en.wikipedia.org/wiki/Marching_cubes is 3D, based on en.wikipedia.org/wiki/Marching_squares mentioned there. Also Azim's answer there is interesting to read. PS: Under wikipedia matlab or java codes are also available. $\endgroup$ Commented Apr 8, 2014 at 18:49