{"title":"利用切比雪夫多项式的约束节约,将任意曲线转化为最小次的bsamzier曲线","authors":"Rattikarn Jaroensawad, N. Dejdumrong","doi":"10.1109/JCSSE.2013.6567350","DOIUrl":null,"url":null,"abstract":"In this paper, we present a new method used for the transformation of a set of discrete points into an analogous Bézier curve. Two algorithms for degree reduction of Bézier curves are then introduced using constrained economization of Chebyshev polynomials with an acceptable error value.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Conversion from an arbitrary curve into a Bézier curve with the least degree using constrained economization of Chebyshev polynomials\",\"authors\":\"Rattikarn Jaroensawad, N. Dejdumrong\",\"doi\":\"10.1109/JCSSE.2013.6567350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a new method used for the transformation of a set of discrete points into an analogous Bézier curve. Two algorithms for degree reduction of Bézier curves are then introduced using constrained economization of Chebyshev polynomials with an acceptable error value.\",\"PeriodicalId\":199516,\"journal\":{\"name\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2013.6567350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Conversion from an arbitrary curve into a Bézier curve with the least degree using constrained economization of Chebyshev polynomials
In this paper, we present a new method used for the transformation of a set of discrete points into an analogous Bézier curve. Two algorithms for degree reduction of Bézier curves are then introduced using constrained economization of Chebyshev polynomials with an acceptable error value.