{"title":"具有可见性属性的单调路径","authors":"L. Gewali, Bikash Lama","doi":"10.1109/ICSEng.2017.53","DOIUrl":null,"url":null,"abstract":"This paper deals with the visibility properties of monotone paths connecting two points in the presence of polygonal obstacles. We examine the development of efficient algorithms for constructing a monotone watchman path from which any point on the boundary of obstacles is visible from some point along the path. Specifically, we formulate visibility aware monotone watchman path (VAMWM) problem and present a heuristic approach for solving it.","PeriodicalId":202005,"journal":{"name":"2017 25th International Conference on Systems Engineering (ICSEng)","volume":"29 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Monotone Paths with Visibility Properties\",\"authors\":\"L. Gewali, Bikash Lama\",\"doi\":\"10.1109/ICSEng.2017.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the visibility properties of monotone paths connecting two points in the presence of polygonal obstacles. We examine the development of efficient algorithms for constructing a monotone watchman path from which any point on the boundary of obstacles is visible from some point along the path. Specifically, we formulate visibility aware monotone watchman path (VAMWM) problem and present a heuristic approach for solving it.\",\"PeriodicalId\":202005,\"journal\":{\"name\":\"2017 25th International Conference on Systems Engineering (ICSEng)\",\"volume\":\"29 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 25th International Conference on Systems Engineering (ICSEng)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSEng.2017.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th International Conference on Systems Engineering (ICSEng)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEng.2017.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper deals with the visibility properties of monotone paths connecting two points in the presence of polygonal obstacles. We examine the development of efficient algorithms for constructing a monotone watchman path from which any point on the boundary of obstacles is visible from some point along the path. Specifically, we formulate visibility aware monotone watchman path (VAMWM) problem and present a heuristic approach for solving it.