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

H.K. Ahn, P. Brass, O. Cheong, H.S. Na, C.S. Shin, A. Vigneron

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
1 Downloads (Pure)

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/Ö{e})logn+1/e3/2)O((1)logn+132) and O((1/)log n+(1/2)log(1/)) respectively.
Original languageEnglish
Title of host publicationComputing and Combinatorics (Proceedings 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004)
EditorsK.Y. Chwa, J.I. Munro
Place of PublicationBerlin
PublisherSpringer
Pages259-267
ISBN (Print)3-540-22856-X
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science
Volume3106
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon'. Together they form a unique fingerprint.

Cite this