Largest Similar Copies of Convex Polygons in Polygonal Domains
- Title
- Largest Similar Copies of Convex Polygons in Polygonal Domains
- Authors
- Eom, Taekang; Lee, Seungjun; AHN, HEE-KAP
- Date Issued
- 2021-12-15
- Publisher
- Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
- Abstract
- Given a convex polygon with k vertices and a polygonal domain consisting of polygonal obstacles with n vertices in total in the plane, we study the optimization problem of finding a largest similar copy of the polygon that can be placed in the polygonal domain without intersecting the obstacles. We present an upper bound O(k
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/110810
- Article Type
- Conference
- Citation
- 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, 2021-12-15
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.