Abstract
We consider the problem of approximating a convex figure in the plane by a pair (τ, R) of homothetic (i.e. similar and parallel) rectangles with τ⊂C⊂R. We show the existence of such pairs where the sides of the outer rectangle have length at most double the length of the inner rectangle, thereby solving a problem posed by Pólya and Szegő.
If the n vertices of a convex polygon C are given as a sorted array, such an approximating pair of rectangles can be computed in time O(log3 n).
This research was supported by the Deutsche Forschungsgemeinschaft under Grant Al 253/1-1, Schwerpunktprogramm “Datenstrukturen und effiziente Algorithmen”
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Helmut Alt, Rudolf Fleischmer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee Yap. On certificates for polygon containment and shape approximation. (manuscript).
F. John. Extremum problems with inequalities as subsidiary conditions. In Courant Anniversary Volume, pages 187–204, New York, 1948.
Marek Lassak. Approximation of plane convex bodies by centrally symmetric bodies. 1989. To appear in J. London Math. Soc.
K. Leichtweiß. Über die affine Exzentrizität konvexer Körper. Arch. Math., 10:187–199, 1959.
G. Pólya and G. Szegö. Isoperimetric inequalities in mathematical physics. Ann. Math. Stud. Princeton, 27, 1951.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwarzkopf, O., Fuchs, U., Rote, G., Welzl, E. (1990). Approximation of convex figures by pairs of rectangles. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_47
Download citation
DOI: https://doi.org/10.1007/3-540-52282-4_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52282-9
Online ISBN: 978-3-540-46945-2
eBook Packages: Springer Book Archive