id: 04098747
dt: j
an: 04098747
au: Alt, Helmut; Wagener, Hubert
ti: Approximation of polygons by rectangles and circles.
so: Bull. EATCS 36, 103-113 (1988).
py: 1988
pu: European Association for Theoretical Computer Science, Leiden
la: EN
cc: 
ut: approximation of convex polygons; Computational complexity; algorithms
ci: 
li: 
ab: The paper addresses the problem of approximating a planar figure (a region
    bounded by some Jordan curve) by a figure from a given fixed set. As a
    measure of the quality of the approximation, the area of the symmetric
    difference of the figure and its approximation is used. Three
    particular problems are optimally solved: approximation of convex
    polygons by an axes-parallel rectangle and approximation of polygons by
    a circle or by a circle with fixed center. Computational complexity of
    the elaborated algorithms is evaluated too. According to the claim of
    authors: “The algorithms and proofs are only sketched and a complete
    version will be given in a subsequent full paper.”
rv: P.Mederly