DC Field | Value | Language |
---|---|---|
dc.contributor.author | De Berg, Mark | ko |
dc.contributor.author | Cabello, Sergio | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Eppstein, David | ko |
dc.contributor.author | Knauer, Christian | ko |
dc.date.accessioned | 2020-01-31T02:20:18Z | - |
dc.date.available | 2020-01-31T02:20:18Z | - |
dc.date.created | 2020-01-22 | - |
dc.date.issued | 2019-01 | - |
dc.identifier.citation | Journal of computational geometry, v.10, no.1, pp.207 - 222 | - |
dc.identifier.issn | 1920-180X | - |
dc.identifier.uri | http://hdl.handle.net/10203/271978 | - |
dc.description.abstract | Let P be a set of n points in the plane. We show how to find, for a given integer k >0, the smallest-area axis-parallel rectangle that covers k points of P in O(nk2logn+ n log2 n) time. We also consider the problem of, given a value α > 0, covering as many points of P as possible with an axis-parallel rectangle of area at most α. For this problem we give a probabilistic (1-ε)-approximation that works in near-linear time: In O((n/ε4) log3 n log(1/ε)) time we find an axis-parallel rectangle of area at most α that, with high probability, covers at least (1-ε)κ* points, where κ* is the maximum possible number of points that could be covered. © 2019, Macodrum library, Carleton University. All rights reserved. | - |
dc.language | English | - |
dc.publisher | MacOdrum Library, Carleton University | - |
dc.title | Covering many points with a small-area box | - |
dc.type | Article | - |
dc.identifier.scopusid | 2-s2.0-85073297435 | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 207 | - |
dc.citation.endingpage | 222 | - |
dc.citation.publicationname | Journal of computational geometry | - |
dc.identifier.doi | 10.20382/jocg.v10i1a8 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | De Berg, Mark | - |
dc.contributor.nonIdAuthor | Cabello, Sergio | - |
dc.contributor.nonIdAuthor | Eppstein, David | - |
dc.contributor.nonIdAuthor | Knauer, Christian | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.