Abstract
Given a convex polygon P with n vertices, we present algorithms to determine approximations of the largest axially symmetric convex polygon S contained in P, and the smallest such polygon S′ that contains P. More precisely, for any ε> 0, we can find an axially symmetric convex polygon Q ⊂ P with area |Q|>(1–ε)|S| in time O(n+1/ε 3/2), and we can find an axially symmetric convex polygon Q′ containing P with area |Q′|<(1+ε)|S′| in time O(n+(1/ε 2)log(1/ε)). If the vertices of P are given in a sorted array, we can obtain the same results in time \(O((1/\sqrt{\varepsilon})\log n+1/\varepsilon^{3/2})\) and O((1/ε)log n+(1/ε 2)log(1/ε)) respectively.
Part of this research was carried out while the authors were participating in the 2nd Korean Workshop on Computational Geometry. The first author acknowledges support from Brain Korea 21 program of MOE. Research of the fourth author is supported by Soongsil University research fund. Research of the fifth author was supported by Hankuk University of Foreign Studies Research Fund of 2004. Research of the last author was supported by the National University of Singapore under grant R–252–000–166–112.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating Extent Measures of Points (2003) (manuscript)
Alt, H., Blömer, J., Godau, M., Wagener, H.: Approximation of convex polygons. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 703–716. Springer, Heidelberg (1990)
Avis, D., Bose, P., Toussaint, G., Shermer, T., Zhu, B., Snoeyink, J.: On the sectional area of convex polytopes. In: Proc. 12th ACM Symp. Comput. geometry, pp. 411– 412 (1996)
Barequet, G., Rogol, V.: Maximizing the area of an axially-symmetric polygon inscribed by a simple polygon (2003) (manuscript)
de Berg, M., Devillers, O., van Kreveld, M., Schwarzkopf, O., Teillaud, M.: Computing the maximum overlap of two convex polygons under translations. Theory of Computing Systems 31, 613–628 (1998)
Dudley, R.M.: Metric entropy of some classes of sets with differentiable boundaries. J. Approximation Theory 10, 227–236 (1974); Erratum in J. Approx. Theory 26, 192–193 (1979)
Grünbaum, B.: Measures of symmetry of convex sets, in ‘Convexity’. In: Klee, V. (ed.) Proc. Symp. Pure Math., vol. 7, pp. 233–270. Amer. Math. Soc, Providence (1963)
John, F.: Extremum problems with inequalities as subsidiary conditions. Courant Anniversary Volume, 187–204 (1948)
Lassak, M.: Approximation of convex bodies by axially symmetric bodies. Proc. Amer. Math. Soc. 130, 3075–3084 (2002); Erratum in Proc. Amer. Math. Soc. 131, 2301 (2003)
Lassak, M.: Approximation of convex bodies by rectangles. Geometriae Dedicata 47, 111–117 (1993)
Lopez, M.A., Reisner, S.: Efficient approximation of convex polygons, Internat. J. Comput. Geom. Appl. 10, 445–452 (2000)
Preparata, P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
also in STACS 1990, LNCS 415, p. 240–249 (1998); In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol. 415, pp. 77–87. Springer, Heidelberg (1990)
de Valcourt, B.A.: Axially symmetric polygons inscribed in and circumscribed about convex polygons. Elemente Math. 22, 121–133 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, HK., Brass, P., Cheong, O., Na, HS., Shin, CS., Vigneron, A. (2004). Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon. In: Chwa, KY., Munro, J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27798-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive