DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.date.accessioned | 2013-02-27T17:41:38Z | - |
dc.date.available | 2013-02-27T17:41:38Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2000-04 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.10, no.2, pp.201 - 220 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.uri | http://hdl.handle.net/10203/69896 | - |
dc.description.abstract | The 1-searcher is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P with a specified boundary point d, is it possible for a 1-searcher to eventually see a mobile intruder that is arbitrarily faster than the searcher within P, before the intruder reaches d? We decide this question in O(n log n)-time for an n-sided polygon. Our main result is a simple characterization of the class of polygons (with a boundary point d) that admits such a search strategy. We also present a simple O(n(2))-time algorithm for constructing a search schedule, if one exists. Finally, we compare the search capability of a 1-searcher with that of two guards. | - |
dc.language | English | - |
dc.publisher | World Scientific Publ Co Pte Ltd | - |
dc.subject | MOBILE INTRUDER | - |
dc.subject | VISIBILITY | - |
dc.title | Searching a polygonal room with one door by a 1-searcher | - |
dc.type | Article | - |
dc.identifier.wosid | 000087386300005 | - |
dc.identifier.scopusid | 2-s2.0-0034390368 | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 201 | - |
dc.citation.endingpage | 220 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.identifier.doi | 10.1142/S0218195900000127 | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | visibility | - |
dc.subject.keywordAuthor | motion planning | - |
dc.subject.keywordAuthor | pursuit-evasion | - |
dc.subject.keywordAuthor | graph algorithm | - |
dc.subject.keywordPlus | MOBILE INTRUDER | - |
dc.subject.keywordPlus | VISIBILITY | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.