On Chebychev fits for pairs of lines and polygons with specified internal angles
Goutam Chatterjee, Bernard J. Roth · Precision Engineering · 1997
Abstract This paper addresss the problems of determining pairs of lines and polygons that best fit a finite set of datapoints. We have determined the best-fit (substitute) feature by minimizing the maximum nromal deviation of the datapoints from the substitute feature. In other words, we have the Cheby-chev or the minimum zone solution. The substitute features of a subset of datapoints. Algorithms are formulated to identify this subset in a given set of datapoints.