DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, Hee-Kap | - |
dc.contributor.author | Abardia, Judit | - |
dc.contributor.author | Bae, Sang Won | - |
dc.contributor.author | Cheong, Otfried | - |
dc.contributor.author | Dann, Susanna | - |
dc.contributor.author | Park, Dongwoo | - |
dc.contributor.author | Shin, Chan-Su | - |
dc.date.accessioned | 2019-04-07T14:59:11Z | - |
dc.date.available | 2019-04-07T14:59:11Z | - |
dc.date.created | 2019-02-07 | - |
dc.date.issued | 2019-03 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/95280 | - |
dc.description.abstract | Given two convex d-polytopes P and Q in R-d for d >= 3, we study the problem of bundling P and Q in a smallest convex container. More precisely, our problem asks to find a minimum convex set containing P and a translate of Q that do not properly overlap each other. We present the first exact algorithm for the problem for any fixed dimension d 3. The running time is O(n((d-1)[d+1]/2)), where n denotes the number of vertices of P and Q. In particular, in dimension d = 3, our algorithm runs in O(n(4)) time. We also give an example of polytopes P and Q such that in the smallest container the translates of P and Q do not touch. (C) 2018 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.title | The minimum convex container of two convex polytopes under translations | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.comgeo.2018.02.004 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.77, pp.40 - 50 | - |
dc.identifier.wosid | 000454975800005 | - |
dc.citation.endPage | 50 | - |
dc.citation.startPage | 40 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 77 | - |
dc.contributor.affiliatedAuthor | Ahn, Hee-Kap | - |
dc.identifier.scopusid | 2-s2.0-85042623144 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.subject.keywordPlus | HULL | - |
dc.subject.keywordPlus | PACKING | - |
dc.subject.keywordAuthor | Packing problem | - |
dc.subject.keywordAuthor | Optimization problem | - |
dc.subject.keywordAuthor | Convex polytope | - |
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.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.