Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon
- Authors
- Ahn, HK; Brass, P; Cheong, O; Na, HS; Shin, CS; Vigneron, A
- Issue Date
- 2004
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- COMPUTING AND COMBINATORICS, PROCEEDINGS, v.3106, pp.259 - 267
- Journal Title
- COMPUTING AND COMBINATORICS, PROCEEDINGS
- Volume
- 3106
- Start Page
- 259
- End Page
- 267
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/20657
- ISSN
- 0302-9743
- 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 e > 0, we can find an axially symmetric convex polygon Q c P with area \Q\ > (1 - epsilon)\S\ in time O(n + 1/epsilon(3/2)), and we can find an axially symmetric convex polygon Q' containing P with area \Q'\ < (1 + E)\S'\ in time 0(n + (1/epsilon(2)) log(1/epsilon)). If the vertices of P are given in a sorted array, we can obtain the same results in time O((1/rootepsilon) log n+1/epsilon(3/2)) and O((1/epsilon) log n+ (1/epsilon(2)) log(1/epsilon)) respectively.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.