{"title":"三角形bsamizier曲面的近似隐式化","authors":"O. Barrowclough, T. Dokken","doi":"10.1145/1925059.1925084","DOIUrl":null,"url":null,"abstract":"We discuss how Dokken's methods of approximate implicitization can be applied to triangular Bézier surfaces in both the original and weak forms. The matrices D and M that are fundamental to the respective forms of approximate implicitization are shown to be constructed essentially by repeated multiplication of polynomials and by matrix multiplication. A numerical approach to weak approximate implicitization is also considered and we show that symmetries within this algorithm can be exploited to reduce the computation time of M. Explicit examples are presented to compare the methods and to demonstrate properties of the approximations.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Approximate implicitization of triangular Bézier surfaces\",\"authors\":\"O. Barrowclough, T. Dokken\",\"doi\":\"10.1145/1925059.1925084\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss how Dokken's methods of approximate implicitization can be applied to triangular Bézier surfaces in both the original and weak forms. The matrices D and M that are fundamental to the respective forms of approximate implicitization are shown to be constructed essentially by repeated multiplication of polynomials and by matrix multiplication. A numerical approach to weak approximate implicitization is also considered and we show that symmetries within this algorithm can be exploited to reduce the computation time of M. Explicit examples are presented to compare the methods and to demonstrate properties of the approximations.\",\"PeriodicalId\":235681,\"journal\":{\"name\":\"Spring conference on Computer graphics\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Spring conference on Computer graphics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1925059.1925084\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Spring conference on Computer graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1925059.1925084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximate implicitization of triangular Bézier surfaces
We discuss how Dokken's methods of approximate implicitization can be applied to triangular Bézier surfaces in both the original and weak forms. The matrices D and M that are fundamental to the respective forms of approximate implicitization are shown to be constructed essentially by repeated multiplication of polynomials and by matrix multiplication. A numerical approach to weak approximate implicitization is also considered and we show that symmetries within this algorithm can be exploited to reduce the computation time of M. Explicit examples are presented to compare the methods and to demonstrate properties of the approximations.