Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3106, Issue , 2004, Pages 259-267

  Ahn, Hee Kap ^a   Brass, Peter ^b   Cheong, Otfried ^c   Na, Hyeon Suk ^d   Shin, Chan Su ^e   Vigneron, Antoine ^f  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b City College of New York   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d Soongsil University   (South Korea)

^e Hankuk University of Foreign Studies   (South Korea)

^f NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY;

AXIALLY SYMMETRIC; CONVEX POLYGON;

APPROXIMATION ALGORITHMS;

EID: 33244494885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_29     Document Type: Article

References (15)

1. P. K. Agarwal, S. Har-Peled, K. R. Varadarajan: Approximating Extent Measures of Points, manuscript 2003.
2. H. Alt, J. Blömer, M. Godau, and H. Wagener: Approximation of convex polygons, Proc. 17th Internat. Colloq. Automata Lang. Program., Lecture Notes Comput. Sci. 443, p. 703-716, Springer-Verlag 1990.
3. D. Avis, P. Bose, G. Toussaint, T. Shermer, B. Zhu, J. Snoeyink: On the sectional area of convex polytopes, Proc. 12th ACM Symp. Comput. geometry, (1996) 411-412.
4. G. Barequet, V. Rogol: Maximizing the area of an axially-symmetric polygon inscribed by a simple polygon, manuscript 2003.
5. M. de Berg, O. Devillers, M. van Kreveld, O. Schwarzkopf, M. Teillaud: Computing the maximum overlap of two convex polygons under translations, Theory of Computing Systems 31 (1998) 613-628.
6. R. M. Dudley: Metric entropy of some classes of sets with differentiable boundaries, J. Approximation Theory 10 (1974) 227-236; Erratum in J. Approx. Theory 26 (1979) 192-193.
7. B. Grünbaum: Measures of symmetry of convex sets, in 'Convexity', V. Klee, ed., Proc. Symp. Pure Math 7, Amer. Math. Soc. 1963, 233-270.
8. F. John: Extremum problems with inequalities as subsidiary conditions, in 'Courant Anniversary Volume', 1948, 187-204.
9. M. Lassak: Approximation of convex bodies by axially symmetric bodies, Proc. Amer. Math. Soc. 130 (2002) 3075-3084. Erratum in Proc. Amer. Math. Soc. 131 (2003) p.2301
10. M. Lassak: Approximation of convex bodies by rectangles, Geometriae Dedicata 47 (1993) 111-117.
11. M.A. Lopez, S. Reisner: Efficient approximation of convex polygons, Internat. J. Comput. Geom. Appl. 10 (2000) 445-452.
12. P. Preparata, M.I. Shamos: Computational Geometry: An Introduction, Springer-Verlag 1985.
13. O. Schwarzkopf, U. Fuchs, G. Rote, E. Welzl: Approximation of convex figures by pairs of rectangles, Comput. Geom. Theory Appl. 10 (1998) 77-87;
14. also in STACS 1990, LNCS 415, p. 240-249.
15. B. A. deValcourt: Axially symmetric polygons inscribed in and circumscribed about convex polygons, Elemente Math. 22 (1967) 121-133.