Bundling three convex polygons to minimize area or perimeter
SCIE
SCOPUS
- Title
- Bundling three convex polygons to minimize area or perimeter
- Authors
- Park, D; Bae, SW; Alt, H; Ahn, HK
- Date Issued
- 2016-01
- Publisher
- ELSEVIER SCIENCE BV
- Abstract
- Given three convex polygons having n vertices in total in the plane, we consider the problem of finding a translation for each polygon such that the translated polygons are pairwise disjoint and the area or the perimeter of their convex hull is minimized. We present the first O(n(2))-time algorithm that finds optimal translations of input polygons using O(n(2)) space for this problem. (C) 2015 Elsevier B.V. All rights reserved.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/35759
- DOI
- 10.1016/J.COMGEO.2015.10.003
- ISSN
- 0925-7721
- Article Type
- Article
- Citation
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, vol. 51, page. 1 - 14, 2016-01
- 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.