There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 52 | - |
dc.citation.startPage | 40 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 80 | - |
dc.contributor.author | Bae, Sang Won | - |
dc.contributor.author | Shin, Chan-Su | - |
dc.contributor.author | Vigneron, Antoine | - |
dc.date.accessioned | 2023-12-21T19:06:34Z | - |
dc.date.available | 2023-12-21T19:06:34Z | - |
dc.date.created | 2019-04-23 | - |
dc.date.issued | 2019-07 | - |
dc.description.abstract | We establish tight bounds for beacon-based coverage problems. In particular, we show that ⌊[Formula presented]⌋ beacons are always sufficient and sometimes necessary to cover a simple rectilinear polygon P with n vertices. When P is monotone and rectilinear, we prove that this bound becomes ⌊[Formula presented]⌋. We also present an optimal linear-time algorithm for computing the beacon kernel of P. | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.80, pp.40 - 52 | - |
dc.identifier.doi | 10.1016/j.comgeo.2019.02.002 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.scopusid | 2-s2.0-85061772509 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/26576 | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0925772119300264?via%3Dihub | - |
dc.identifier.wosid | 000466832800004 | - |
dc.language | 영어 | - |
dc.publisher | Elsevier BV | - |
dc.title | Tight bounds for beacon-based coverage in simple rectilinear polygons | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied; Mathematics | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Art gallery | - |
dc.subject.keywordAuthor | Beacon | - |
dc.subject.keywordAuthor | Algorithm | - |
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.