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:37Z | - |
dc.date.available | 2016-04-01T08:41:37Z | - |
dc.date.created | 2009-09-30 | - |
dc.date.issued | 2006-02 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.other | 2006-OAK-0000017748 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/28554 | - |
dc.description.abstract | Given a planar convex set C, we give sublinear approximation algorithms to determine approximations of the largest axially symmetric convex set S contained in C, and the smallest such set S' that contains C. More precisely, for any epsilon > 0, we find an axially symmetric convex polygon Q subset of C with area vertical bar Q vertical bar > (1 - epsilon)vertical bar S vertical bar and we find an axially symmetric convex polygon Q' containing C with area vertical bar Q'vertical bar < (1 + epsilon)vertical bar S'vertical bar. We assume that C is given in a data structure that allows to answer the following two types of query in time T-C: given a direction u, find an extreme point of C in direction u, and given a line l, find C boolean AND l. For instance, if C is a convex n-gon and its vertices are given in a sorted array, then T-C = O(logn). Then we can find Q and Q' in time O(epsilon T--1/2(C) + epsilon(-3/2)). Using these techniques, we can also find approximations to the perimeter, area, diameter, width, smallest enclosing rectangle and smallest enclosing circle of C in time O(epsilon T--1/2(C)). (c) 2005 Elsevier B.V. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.title | INSCRIBING AN AXIALLY SYMMETRIC POLYGON AND OTHER APPROXIMATION ALGORITHMS FOR PLANAR CONVEX SETS | - |
dc.type | Article | - |
dc.contributor.college | 컴퓨터공학과 | - |
dc.identifier.doi | 10.1016/j.comgeo.2005.06.001 | - |
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 | 33 | - |
dc.relation.issue | 3 | - |
dc.relation.startpage | 152 | - |
dc.relation.lastpage | 164 | - |
dc.contributor.id | 10152366 | - |
dc.relation.journal | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.33, no.3, pp.152 - 164 | - |
dc.identifier.wosid | 000235252400006 | - |
dc.date.tcdate | 2019-02-01 | - |
dc.citation.endPage | 164 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 152 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 33 | - |
dc.contributor.affiliatedAuthor | Ahn, HK | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 10 | - |
dc.description.isOpenAccess | N | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | axial symmetry | - |
dc.subject.keywordAuthor | approximation | - |
dc.subject.keywordAuthor | shape matching | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
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.