DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.contributor.author | Jo, Byung-Cheol | ko |
dc.contributor.author | Knauer, Christian | ko |
dc.contributor.author | Moet, Esther | ko |
dc.contributor.author | van Oostrum, Rene | ko |
dc.contributor.author | Shin, Chan-Su | ko |
dc.date.accessioned | 2013-03-07T03:27:53Z | - |
dc.date.available | 2013-03-07T03:27:53Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2006-01 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.16, no.2-3, pp.205 - 226 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.uri | http://hdl.handle.net/10203/89298 | - |
dc.description.abstract | Let P be a polygon, possibly with holes. We define a witness set W to be a set of points in P such that if any (prospective) guard set G guards W, then it is guaranteed that G guards P. Not all polygons admit a finite witness set. If a finite minimal witness set exists, then it cannot contain any witness in the interior of P; all witnesses must lie on the boundary of P, and there can be at most one witness in the interior of every edge. We give an algorithm to compute a minimum size witness set for P in O(n(2) log n) time, if such a set exists, or to report the non-existence within the same time bounds. We also outline two algorithms that use a witness set. for P to test whether a (prospective) guard set sees all points in P. | - |
dc.language | English | - |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.title | Guarding art galleries by guarding witnesses | - |
dc.type | Article | - |
dc.identifier.wosid | 000237575800007 | - |
dc.identifier.scopusid | 2-s2.0-33646511751 | - |
dc.type.rims | ART | - |
dc.citation.volume | 16 | - |
dc.citation.issue | 2-3 | - |
dc.citation.beginningpage | 205 | - |
dc.citation.endingpage | 226 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.identifier.doi | 10.1142/S0218195906002002 | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.contributor.nonIdAuthor | Jo, Byung-Cheol | - |
dc.contributor.nonIdAuthor | Knauer, Christian | - |
dc.contributor.nonIdAuthor | Moet, Esther | - |
dc.contributor.nonIdAuthor | van Oostrum, Rene | - |
dc.contributor.nonIdAuthor | Shin, Chan-Su | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | computational geometry | - |
dc.subject.keywordAuthor | visibility | - |
dc.subject.keywordAuthor | art gallery problem | - |
dc.subject.keywordAuthor | witness set | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | POLYGON | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.