DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cabello, Sergio | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Knauer, Christian | ko |
dc.contributor.author | Schlipf, Lena | ko |
dc.date.accessioned | 2016-05-16T08:46:05Z | - |
dc.date.available | 2016-05-16T08:46:05Z | - |
dc.date.created | 2015-12-22 | - |
dc.date.created | 2015-12-22 | - |
dc.date.issued | 2016-01 | - |
dc.identifier.citation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.51, pp.67 - 74 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.uri | http://hdl.handle.net/10203/207435 | - |
dc.description.abstract | We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with n vertices. We give exact algorithms that solve these problems in time O(n(3)). We also give (1 - epsilon)-approximation algorithms that take time O(epsilon(-1/2) log n + epsilon(-3/2)). | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | APPROXIMATION | - |
dc.title | Finding largest rectangles in convex polygons | - |
dc.type | Article | - |
dc.identifier.wosid | 000365374600006 | - |
dc.identifier.scopusid | 2-s2.0-84947047194 | - |
dc.type.rims | ART | - |
dc.citation.volume | 51 | - |
dc.citation.beginningpage | 67 | - |
dc.citation.endingpage | 74 | - |
dc.citation.publicationname | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.identifier.doi | 10.1016/j.comgeo.2015.08.001 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Cabello, Sergio | - |
dc.contributor.nonIdAuthor | Knauer, Christian | - |
dc.contributor.nonIdAuthor | Schlipf, Lena | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Geometric optimization | - |
dc.subject.keywordAuthor | Approximation algorithm | - |
dc.subject.keywordAuthor | Convex polygon | - |
dc.subject.keywordAuthor | Inscribed rectangle | - |
dc.subject.keywordPlus | APPROXIMATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.