Open Access System for Information Sharing

Login Library

 

Article
Cited 7 time in webofscience Cited 9 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorAhn, HK-
dc.contributor.authorBae, S-
dc.contributor.authorCheong, O-
dc.contributor.authorGudmundsson, J-
dc.date.accessioned2016-04-01T09:03:40Z-
dc.date.available2016-04-01T09:03:40Z-
dc.date.created2009-03-20-
dc.date.issued2008-10-
dc.identifier.issn0179-5376-
dc.identifier.other2008-OAK-0000010966-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/29368-
dc.description.abstractThe aperture angle alpha(x, Q) of a point x is not an element of Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the plane with respect to an inscribed convex polygon Q. C is the minimum aperture angle of any x is an element of C \ Q with respect to Q. We show that for any compact convex set C in the plane and any k > 2, there is an inscribed convex k-gon Q subset of C with aperture angle approximation error (1 - 2/k+1)pi. This bound is optimal, and settles a conjecture by Fekete from the early 1990s. The same proof technique can be used to prove a conjecture by Brass: If a polygon P admits no approximation by a sub-k-gon (the convex hull of k vertices of P) with Hausdorff distance sigma, but all subpolygons of P (the convex hull of some vertices of P) admit such an approximation, then P is a (k + 1)-gon. This implies the following result: For any k > 2 and any convex polygon P of perimeter at most 1 there is a sub-k-gon Q of P such that the Hausdorff-distance of P and Q is at most 1/k+1 sin pi/k+1.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherSPRINGER-
dc.relation.isPartOfDISCRETE & COMPUTATIONAL GEOMETRY-
dc.subjectHausdorff approximation-
dc.subjectaperture angle-
dc.subjectconvex figure-
dc.subjectsubpolygon-
dc.titleAperture-angle and Hausdorff-approximation of convex figures-
dc.typeArticle-
dc.contributor.college컴퓨터공학과-
dc.identifier.doi10.1007/s00454-007-9039-5-
dc.author.googleAhn, HK-
dc.author.googleBae, S-
dc.author.googleCheong, O-
dc.author.googleGudmundsson, J-
dc.relation.volume40-
dc.relation.issue3-
dc.relation.startpage414-
dc.relation.lastpage429-
dc.contributor.id10152366-
dc.relation.journalDISCRETE & COMPUTATIONAL GEOMETRY-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCI-
dc.collections.nameJournal Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationDISCRETE & COMPUTATIONAL GEOMETRY, v.40, no.3, pp.414 - 429-
dc.identifier.wosid000259563600008-
dc.date.tcdate2019-02-01-
dc.citation.endPage429-
dc.citation.number3-
dc.citation.startPage414-
dc.citation.titleDISCRETE & COMPUTATIONAL GEOMETRY-
dc.citation.volume40-
dc.contributor.affiliatedAuthorAhn, HK-
dc.identifier.scopusid2-s2.0-52949129795-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc6-
dc.type.docTypeArticle-
dc.subject.keywordAuthorHausdorff approximation-
dc.subject.keywordAuthoraperture angle-
dc.subject.keywordAuthorconvex figure-
dc.subject.keywordAuthorsubpolygon-
dc.relation.journalWebOfScienceCategoryComputer Science, Theory & Methods-
dc.relation.journalWebOfScienceCategoryMathematics-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaMathematics-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

안희갑AHN, HEE-KAP
Grad. School of AI
Read more

Views & Downloads

Browse