There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
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.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 | 2023-12-22T10:08:08Z | - |
dc.date.available | 2023-12-22T10:08:08Z | - |
dc.date.created | 2016-06-10 | - |
dc.date.issued | 2006-02 | - |
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)). | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.33, no.3, pp.152 - 164 | - |
dc.identifier.doi | 10.1016/j.comgeo.2005.06.001 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.scopusid | 2-s2.0-84867925351 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19651 | - |
dc.identifier.url | http://www.sciencedirect.com/science/article/pii/S092577210500043X | - |
dc.identifier.wosid | 000235252400006 | - |
dc.language | 영어 | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | axial symmetry | - |
dc.subject.keywordAuthor | approximation | - |
dc.subject.keywordAuthor | shape matching | - |
dc.subject.keywordPlus | RECTANGLES | - |
dc.subject.keywordPlus | TUBES | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.