Given a continuous and bounded function f(t,s), t,s∈[0,1], I would like to compute maxt2∈[0,1]mint1∈[0,1]|f(t1,s1)−f(t2,s2)|, for each numeric values of s1 and s2. I tried by combining NMaxValue and NMinValue but the time is prohibitively large.
I read on the Internet that this distance is sometimes referred to as Fréchet or Hausdorff distance. Is there a built-in function in Mathematica that solves this max-min problem (something like NMaxMinValue)? Or which would be the correct algorithm to proceed with?
Comments
Post a Comment