April 1963 - Vol. 6 No. 4

April 1963 issue cover image

Features

Research and Advances

Least squares fitting of planes to surfaces using dynamic programming

Dynamic programming has recently been used by Stone, by Bellman and by Gluss to determine the closest fit of broken line segments to a curve in an interval under the constraint that the number of segments is fixed. In the present paper successive models are developed to extend the method to the fitting of broken plane segments to surfaces z = g(x, y) defined over certain types of subareas of the (x, y)-space. The first model considers a rectangular area, with the constraint that the plane segments are defined over a grid in the (x, y)-space. It is then shown how this model may be incorporated into an algorithm that provides successive approximations to optimal fits for any type of closed area. Finally, applications are briefly described.

Recent Issues

  1. November 2024 CACM cover
    November 2024 Vol. 67 No. 11
  2. October 2024 CACM cover
    October 2024 Vol. 67 No. 10
  3. September 2024 CACM cover
    September 2024 Vol. 67 No. 9
  4. August 2024 CACM cover
    August 2024 Vol. 67 No. 8