Thumbnail
Access Restriction
Subscribed

Author Gluss, Brian
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: Univ. of California, Berkeley, CA (Gluss, Brian)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 6
Issue Number 4
Page Count 4
Starting Page 172
Ending Page 175


Open content in new tab

   Open content in new tab
Source: ACM Digital Library