{"title":"伪三角形多边形可见性图边界环的计算","authors":"Hossein Boomari Soheila Farokhi","doi":"10.1007/978-3-030-57852-7_5","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":225805,"journal":{"name":"International Conference on Topics in Theoretical Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computing Boundary Cycle of a Pseudo-Triangle Polygon from its Visibility Graph\",\"authors\":\"Hossein Boomari Soheila Farokhi\",\"doi\":\"10.1007/978-3-030-57852-7_5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":225805,\"journal\":{\"name\":\"International Conference on Topics in Theoretical Computer Science\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Topics in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-57852-7_5\",\"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 Conference on Topics in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-57852-7_5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}