An optimal way of moving a sequence of points onto a curve in two dimensions

Abstract

Let s̲(t), 0 ≤ t ≤ T, be a smooth curve and let x̲i, i = 1, 2, ... , n, be a sequence of points in two dimensions. An algorithm is given that calculates the parameters ti, i = 1,2, ... ,n, that minimize the function max{llx̲i-s̲(ti)ll₂: i = 1, 2, ... , n} subject to the constraints 0 ≤ t₁≤ t₂≤ · · · ≤ tn ≤ T. Further, the final value of the objective function is best lexicographically, when the distances llx̲i-s̲(ti)ll₂, i= 1, 2, ... , n, are sorted into decreasing order. The algorithm finds the global solution to this calculation. Usually the magnitude of the total work is only about n when the number of data points is large. The efficiency comes from techniques that use bounds on the final values of the parameters to split the original problem into calculations that have fewer variables. The splitting techniques are analysed, the algorithm is described, and some numerical results are presented and discussed.