Article
Cited 2 time in 
Cited 3 time in 
Cited 3 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, D | - |
| dc.contributor.author | Bae, SW | - |
| dc.contributor.author | Alt, H | - |
| dc.contributor.author | Ahn, HK | - |
| dc.date.accessioned | 2017-07-19T12:23:23Z | - |
| dc.date.available | 2017-07-19T12:23:23Z | - |
| dc.date.created | 2016-01-26 | - |
| dc.date.issued | 2016-01 | - |
| dc.identifier.issn | 0925-7721 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/35759 | - |
| dc.description.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. | - |
| dc.language | English | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.relation.isPartOf | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
| dc.title | Bundling three convex polygons to minimize area or perimeter | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1016/J.COMGEO.2015.10.003 | - |
| dc.type.rims | ART | - |
| dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.51, pp.1 - 14 | - |
| dc.identifier.wosid | 000365374600001 | - |
| dc.date.tcdate | 2019-03-01 | - |
| dc.citation.endPage | 14 | - |
| dc.citation.startPage | 1 | - |
| dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
| dc.citation.volume | 51 | - |
| dc.contributor.affiliatedAuthor | Ahn, HK | - |
| dc.identifier.scopusid | 2-s2.0-84945217374 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
| dc.description.wostc | 1 | - |
| dc.description.scptc | 0 | * |
| dc.date.scptcdate | 2018-05-121 | * |
| dc.type.docType | Article | - |
| dc.subject.keywordAuthor | Packing problem | - |
| dc.subject.keywordAuthor | Convex polygon | - |
| dc.subject.keywordAuthor | Optimization | - |
| dc.subject.keywordAuthor | Exact algorithm | - |
| dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
| dc.relation.journalWebOfScienceCategory | Mathematics | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Communities & Collection
Related Researcher
- 안희갑AHN, HEE-KAP
- Grad. School of AI