{"title":"构形空间障碍物的度量和拓扑性质计算","authors":"R. Brost","doi":"10.1109/ROBOT.1989.99985","DOIUrl":null,"url":null,"abstract":"The author describes an algorithm that takes two polygons as input, and computes a representation of their corresponding configuration-space obstacle, including contact information. The algorithm's output includes a full metric and topological description of the obstacle surface, as well as the set of polygon features that are in contact for each point of the surface. The representation is exact, up to the limits of floating-point arithmetic. The algorithm has been implemented and test-run on over 40 input pairs; run times varied between 12 and 135 s.<<ETX>>","PeriodicalId":114394,"journal":{"name":"Proceedings, 1989 International Conference on Robotics and Automation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"86","resultStr":"{\"title\":\"Computing metric and topological properties of configuration-space obstacles\",\"authors\":\"R. Brost\",\"doi\":\"10.1109/ROBOT.1989.99985\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author describes an algorithm that takes two polygons as input, and computes a representation of their corresponding configuration-space obstacle, including contact information. The algorithm's output includes a full metric and topological description of the obstacle surface, as well as the set of polygon features that are in contact for each point of the surface. The representation is exact, up to the limits of floating-point arithmetic. The algorithm has been implemented and test-run on over 40 input pairs; run times varied between 12 and 135 s.<<ETX>>\",\"PeriodicalId\":114394,\"journal\":{\"name\":\"Proceedings, 1989 International Conference on Robotics and Automation\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"86\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings, 1989 International Conference on Robotics and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROBOT.1989.99985\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings, 1989 International Conference on Robotics and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBOT.1989.99985","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computing metric and topological properties of configuration-space obstacles
The author describes an algorithm that takes two polygons as input, and computes a representation of their corresponding configuration-space obstacle, including contact information. The algorithm's output includes a full metric and topological description of the obstacle surface, as well as the set of polygon features that are in contact for each point of the surface. The representation is exact, up to the limits of floating-point arithmetic. The algorithm has been implemented and test-run on over 40 input pairs; run times varied between 12 and 135 s.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
