DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.contributor.author | 박상민 | ko |
dc.contributor.author | 이재하 | ko |
dc.date.accessioned | 2013-03-03T16:57:35Z | - |
dc.date.available | 2013-03-03T16:57:35Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2002-08 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.12, no.4, pp.339 - 352 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.uri | http://hdl.handle.net/10203/79576 | - |
dc.description.abstract | We consider the problem of searching for mobile intruders in a polygonal region with one door by two guards. Given a simple polygon P with a door d, which is called a room (P, d), two guards start at d and walk along the boundary of P to detect a mobile intruder with a laser beam between the two guards. During the walk, two guards are required to be mutually visible all the time and eventually meet at one point. We give a characterization of the class of rooms searchable by two guards and an O (n log n)-time algorithm to test if a given room admits a walk, where n is the number of the vertices in P. | - |
dc.language | English | - |
dc.publisher | World Scientific Publ Co Pte Ltd | - |
dc.subject | SIMPLE POLYGONS | - |
dc.subject | OPTIMAL ALGORITHM | - |
dc.subject | MOBILE INTRUDER | - |
dc.subject | VISIBILITY | - |
dc.subject | EDGE | - |
dc.title | Searching a room by two guards | - |
dc.type | Article | - |
dc.identifier.wosid | 000177708900006 | - |
dc.identifier.scopusid | 2-s2.0-0036695518 | - |
dc.type.rims | ART | - |
dc.citation.volume | 12 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 339 | - |
dc.citation.endingpage | 352 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.contributor.nonIdAuthor | 박상민 | - |
dc.contributor.nonIdAuthor | 이재하 | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordAuthor | visibility | - |
dc.subject.keywordAuthor | motion planning | - |
dc.subject.keywordAuthor | two guards | - |
dc.subject.keywordAuthor | room | - |
dc.subject.keywordPlus | SIMPLE POLYGONS | - |
dc.subject.keywordPlus | OPTIMAL ALGORITHM | - |
dc.subject.keywordPlus | MOBILE INTRUDER | - |
dc.subject.keywordPlus | VISIBILITY | - |
dc.subject.keywordPlus | EDGE | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.