{"title":"走向超鲁棒几何计算","authors":"K. Sugihara","doi":"10.1145/1364901.1364905","DOIUrl":null,"url":null,"abstract":"To make geometric computation robust against numerical errors is one of the most important issues for practical applications of geometric algorithms. We first review existing approaches to robust geometric computation, and next show that there still remain many difficulties. Finally we discuss possible directions to overcome these difficulties and thus to achieve superrobustness.","PeriodicalId":216067,"journal":{"name":"Symposium on Solid and Physical Modeling","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Toward superrobust geometric computation\",\"authors\":\"K. Sugihara\",\"doi\":\"10.1145/1364901.1364905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To make geometric computation robust against numerical errors is one of the most important issues for practical applications of geometric algorithms. We first review existing approaches to robust geometric computation, and next show that there still remain many difficulties. Finally we discuss possible directions to overcome these difficulties and thus to achieve superrobustness.\",\"PeriodicalId\":216067,\"journal\":{\"name\":\"Symposium on Solid and Physical Modeling\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Solid and Physical Modeling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1364901.1364905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Solid and Physical Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1364901.1364905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
To make geometric computation robust against numerical errors is one of the most important issues for practical applications of geometric algorithms. We first review existing approaches to robust geometric computation, and next show that there still remain many difficulties. Finally we discuss possible directions to overcome these difficulties and thus to achieve superrobustness.