DC Field | Value | Language |
---|---|---|
dc.contributor.author | Seong, KA | ko |
dc.contributor.author | Lee, Kwang-Hyung | ko |
dc.date.accessioned | 2013-03-03T02:34:38Z | - |
dc.date.available | 2013-03-03T02:34:38Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1996 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, v.60, no.3-4, pp.155 - 169 | - |
dc.identifier.issn | 0020-7160 | - |
dc.identifier.uri | http://hdl.handle.net/10203/76776 | - |
dc.description.abstract | If a point p is visible from m distinct points, the point p is said to be m-visible. For a simple polygonal shape art gallery P, it is shown that the minimum number of guards required for P to be in-visible is either 2(m - 1) + 1 or 3(m - 1) + 1 if P is a star-shaped polygon with the property that P is visible from only a boundary point. For any simple polygon with n vertices, it is also shown that the [n/3] x m guards are occasionally necessary and always sufficient. The algorithms to locate the determined guards on the given gallery (or polygon) are also presented. | - |
dc.language | English | - |
dc.publisher | GORDON BREACH SCI PUBL LTD | - |
dc.subject | OPTIMAL ALGORITHM | - |
dc.subject | POLYGON | - |
dc.subject | THEOREM | - |
dc.title | Multiple point visibility and related problems | - |
dc.type | Article | - |
dc.identifier.wosid | A1996UW39900001 | - |
dc.identifier.scopusid | 2-s2.0-0029723963 | - |
dc.type.rims | ART | - |
dc.citation.volume | 60 | - |
dc.citation.issue | 3-4 | - |
dc.citation.beginningpage | 155 | - |
dc.citation.endingpage | 169 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | - |
dc.identifier.doi | 10.1080/00207169608804483 | - |
dc.contributor.localauthor | Lee, Kwang-Hyung | - |
dc.contributor.nonIdAuthor | Seong, KA | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | computational geometry | - |
dc.subject.keywordAuthor | art gallery problem | - |
dc.subject.keywordAuthor | multiple point visibility | - |
dc.subject.keywordPlus | OPTIMAL ALGORITHM | - |
dc.subject.keywordPlus | POLYGON | - |
dc.subject.keywordPlus | THEOREM | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.