DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, HK | ko |
dc.contributor.author | Brass, P | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Na, HS | ko |
dc.contributor.author | Shin, CS | ko |
dc.contributor.author | Vigneron, A | ko |
dc.date.accessioned | 2007-05-25 | - |
dc.date.available | 2007-05-25 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2006-02 | - |
dc.identifier.citation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.33, no.3, pp.152 - 164 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.uri | http://hdl.handle.net/10203/314 | - |
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.sponsorship | This research was supported by the Brain Korea 21 Project, The School of Information Technology, KAIST, 2005; by the Soongsil University research fund; by the Hankuk University of Foreign Studies Research Fund of 2005; and by the National University of Singapore under grant R.252.000.166.112. | en |
dc.language | English | - |
dc.language.iso | en | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | RECTANGLES | - |
dc.subject | TUBES | - |
dc.title | Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets | - |
dc.type | Article | - |
dc.identifier.wosid | 000235252400006 | - |
dc.identifier.scopusid | 2-s2.0-84867925351 | - |
dc.type.rims | ART | - |
dc.citation.volume | 33 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 152 | - |
dc.citation.endingpage | 164 | - |
dc.citation.publicationname | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.identifier.doi | 10.1016/j.comgeo.2005.06.001 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Ahn, HK | - |
dc.contributor.nonIdAuthor | Brass, P | - |
dc.contributor.nonIdAuthor | Na, HS | - |
dc.contributor.nonIdAuthor | Shin, CS | - |
dc.contributor.nonIdAuthor | Vigneron, A | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | axial symmetry | - |
dc.subject.keywordAuthor | approximation | - |
dc.subject.keywordAuthor | shape matching | - |
dc.subject.keywordPlus | RECTANGLES | - |
dc.subject.keywordPlus | TUBES | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.