@inproceedings{dde7771deb4241119e6386e629891f74,

title = "Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon",

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$\varepsilon>0$0 , we can find an axially symmetric convex polygon Q O((1/{\"O}{e})logn+1/e3/2)O((1)logn+132) and O((1/)log n+(1/2)log(1/)) respectively.",

author = "H.K. Ahn and P. Brass and O. Cheong and H.S. Na and C.S. Shin and A. Vigneron",

year = "2004",

doi = "10.1007/978-3-540-27798-9_29",

language = "English",

isbn = "3-540-22856-X",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "259--267",

editor = "K.Y. Chwa and J.I. Munro",

booktitle = "Computing and Combinatorics (Proceedings 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004)",

address = "Germany",

}