在多边形域中查询两个边界点的最短路径

{"title":"在多边形域中查询两个边界点的最短路径","authors":"S. Bae, Y. Okamoto","doi":"10.1007/978-3-642-10631-6_106","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"23 1","pages":"284-293"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Querying Two Boundary Points for Shortest Paths in a Polygonal Domain\",\"authors\":\"S. Bae, Y. Okamoto\",\"doi\":\"10.1007/978-3-642-10631-6_106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":11245,\"journal\":{\"name\":\"Discret. Comput. Geom.\",\"volume\":\"23 1\",\"pages\":\"284-293\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Comput. Geom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-10631-6_106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Comput. Geom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-10631-6_106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}