DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Journal Papers(저널논문)

Item 10203/316

Cited 33 time in webofscience Cited 0 time in scopus
  • Hit : 1044
  • Download : 2702
Export
DC FieldValueLanguage
dc.contributor.authorCheong, Otfriedko
dc.contributor.authorEfrat, Ako
dc.contributor.authorHar-Peled, Sko
dc.date.accessioned2007-05-25-
dc.date.available2007-05-25-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2007-05-
dc.identifier.citationDISCRETE & COMPUTATIONAL GEOMETRY, v.37, no.4, pp.545 - 563-
dc.identifier.issn0179-5376-
dc.identifier.urihttp://hdl.handle.net/10203/316-
dc.description.abstractWe present a near-quadratic time algorithm that computes a point inside a simple polygon P in the plane having approximately the largest visibility polygon inside P, and a near-linear time algorithm for finding the point that will have approximately the largest Voronoi region when added to an n-point set in the plane. We apply the same technique to find the translation that approximately maximizes the area of intersection of two polygonal regions in near-quadratic time, and the rigid motion doing so in near-cubic time.-
dc.description.sponsorshipWork on this paper was partially supported by a NSF CAREER award CCR-0132901.en
dc.languageEnglish-
dc.language.isoenen
dc.publisherSPRINGER-
dc.subjectCOMPUTATIONAL GEOMETRY-
dc.subjectVORONOI GAME-
dc.subjectOVERLAP-
dc.subjectAREA-
dc.subjectGALLERIES-
dc.subjectPOLYGONS-
dc.typeArticle-
dc.identifier.wosid000246174800004-
dc.identifier.scopusid2-s2.0-34247575298-
dc.type.rimsART-
dc.citation.volume37-
dc.citation.issue4-
dc.citation.beginningpage545-
dc.citation.endingpage563-
dc.citation.publicationnameDISCRETE & COMPUTATIONAL GEOMETRY-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorEfrat, A-
dc.contributor.nonIdAuthorHar-Peled, S-
dc.type.journalArticleArticle-
dc.subject.keywordPlusCOMPUTATIONAL GEOMETRY-
dc.subject.keywordPlusVORONOI GAME-
dc.subject.keywordPlusOVERLAP-
dc.subject.keywordPlusAREA-
dc.subject.keywordPlusGALLERIES-
dc.subject.keywordPlusPOLYGONS-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 33 items in WoS Click to see citing articles in records_button

Display Simple Item Record

qr_code

  • mendeley

    citeulike

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


rss_1.0 rss_2.0 atom_1.0