Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, R. V. Oostrum, C. Shin
{"title":"护卫证人护卫艺术画廊","authors":"Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, R. V. Oostrum, C. Shin","doi":"10.1142/S0218195906002002","DOIUrl":null,"url":null,"abstract":"Let P be a simple polygon We define a witness setW to be a set of points 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 witness set for P in O(n2log n) time, if such a set exists, or to report the non-existence within the same time bounds.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Guarding Art Galleries by Guarding Witnesses\",\"authors\":\"Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, R. V. Oostrum, C. Shin\",\"doi\":\"10.1142/S0218195906002002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let P be a simple polygon We define a witness setW to be a set of points 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 witness set for P in O(n2log n) time, if such a set exists, or to report the non-existence within the same time bounds.\",\"PeriodicalId\":285210,\"journal\":{\"name\":\"International Journal of Computational Geometry and Applications\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0218195906002002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0218195906002002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let P be a simple polygon We define a witness setW to be a set of points 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 witness set for P in O(n2log n) time, if such a set exists, or to report the non-existence within the same time bounds.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
