DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, HK | - |
dc.contributor.author | Brass, P | - |
dc.contributor.author | Cheong, O | - |
dc.contributor.author | Na, HS | - |
dc.contributor.author | Shin, CS | - |
dc.contributor.author | Vigneron, A | - |
dc.date.accessioned | 2016-04-01T08:41:51Z | - |
dc.date.available | 2016-04-01T08:41:51Z | - |
dc.date.created | 2009-09-30 | - |
dc.date.issued | 2004-08 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.other | 2004-OAK-0000017739 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/28562 | - |
dc.description.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. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.relation.isPartOf | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.subject | RECTANGLES | - |
dc.subject | BODIES | - |
dc.title | APPROXIMATION ALGORITHMS FOR INSCRIBING OR CIRCUMSCRIBING AN AXIALLY SYMMETRIC POLYGON TO A CONVEX POLYGON | - |
dc.type | Article | - |
dc.contributor.college | 컴퓨터공학과 | - |
dc.author.google | AHN, HK | - |
dc.author.google | BRASS, P | - |
dc.author.google | CHEONG, O | - |
dc.author.google | NA, HS | - |
dc.author.google | SHIN, CS | - |
dc.author.google | VIGNERON, A | - |
dc.relation.volume | 3106 | - |
dc.relation.startpage | 259 | - |
dc.relation.lastpage | 267 | - |
dc.contributor.id | 10152366 | - |
dc.relation.journal | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Conference Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | LECTURE NOTES IN COMPUTER SCIENCE, v.3106, pp.259 - 267 | - |
dc.identifier.wosid | 000223614000029 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 267 | - |
dc.citation.startPage | 259 | - |
dc.citation.title | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.citation.volume | 3106 | - |
dc.contributor.affiliatedAuthor | Ahn, HK | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 1 | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
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.