File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace MX -
dc.citation.conferencePlace Ensenada -
dc.citation.endPage 122 -
dc.citation.startPage 110 -
dc.citation.title LATIN 2016 (12th Latin American Theoretical Informatics Symposium) -
dc.contributor.author Bae, Sang Won -
dc.contributor.author Shin, Chan-Su -
dc.contributor.author Vigneron, Antoine -
dc.date.accessioned 2023-12-19T21:07:01Z -
dc.date.available 2023-12-19T21:07:01Z -
dc.date.created 2016-06-21 -
dc.date.issued 2016-04-13 -
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 LATIN 2016 (12th Latin American Theoretical Informatics Symposium), pp.110 - 122 -
dc.identifier.doi 10.1007/978-3-662-49529-2_9 -
dc.identifier.issn 0302-9743 -
dc.identifier.scopusid 2-s2.0-84961718048 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/34351 -
dc.identifier.url https://link.springer.com/chapter/10.1007%2F978-3-662-49529-2_9 -
dc.language 영어 -
dc.publisher LATIN 2016 (12th Latin American Theoretical Informatics Symposium) -
dc.title Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons -
dc.type Conference Paper -
dc.date.conferenceDate 2016-04-11 -

qrcode

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