Portal de Periódicos da CAPES

On Chebychev fits for pairs of lines and polygons with specified internal angles

1997; Elsevier BV; Volume: 21; Issue: 1 Linguagem: Inglês

10.1016/s0141-6359(97)00066-4

1873-2372

Goutam Chatterjee, Bernard Roth,

Digital Image Processing Techniques

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.