Skip to main content
. 2021 Apr 7;21(8):2589. doi: 10.3390/s21082589
Algorithm 1: Lamé curve parameter optimization.
Input:x′1, y′1, x′2, y′2, b_step, n_step
Output:b, n

  1. best_b = −1, best_n = −1, best_arc = 104, n = 10

  2. do
    1. n = n − n_step
    2. b = max(y′1, y′2) + 50
    3. do
      1. b = b − b_step
      2. t = test(x′1,y′1,x′2,y′2,b,n)
      3. ift < 1
        1. arc = evalArc(b,n)
        2. if arc < best_arc
          1. best_arc = arc
          2. best_b = b
          3. best_n = n
    4. whileb > max(y′1, y′2) and t < 1

  3. whilen > 1

  4. return best_b, best_n