使用切比雪夫多项式的Bezier曲线的高效手写曲线逼近

2013 10th International Conference Computer Graphics, Imaging and Visualization Pub Date : 2013-08-06 DOI:10.1109/CGIV.2013.22

Rattikarn Jaroensawad, N. Dejdumrong, Somchai Prakancharoen

{"title":"使用切比雪夫多项式的Bezier曲线的高效手写曲线逼近","authors":"Rattikarn Jaroensawad, N. Dejdumrong, Somchai Prakancharoen","doi":"10.1109/CGIV.2013.22","DOIUrl":null,"url":null,"abstract":"This paper presents two methodologies for approximating a handwritten curve by a Bézier curve using Chebyshev Polynomials. First, two different featured point selection techniques, are introduced in algorithms 1 and 2. Algorithm 1 uses frequency while algorithm 2 uses the analysis of inflection point. Then, using Chebyshev Polynomials for approximation curve, however a new curve must be adjusted by algorithm 3 because the end points of curve are swing.","PeriodicalId":342914,"journal":{"name":"2013 10th International Conference Computer Graphics, Imaging and Visualization","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Handwritten Curve Approximation by a Bezier Curve Using Chebyshev Polynomials\",\"authors\":\"Rattikarn Jaroensawad, N. Dejdumrong, Somchai Prakancharoen\",\"doi\":\"10.1109/CGIV.2013.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents two methodologies for approximating a handwritten curve by a Bézier curve using Chebyshev Polynomials. First, two different featured point selection techniques, are introduced in algorithms 1 and 2. Algorithm 1 uses frequency while algorithm 2 uses the analysis of inflection point. Then, using Chebyshev Polynomials for approximation curve, however a new curve must be adjusted by algorithm 3 because the end points of curve are swing.\",\"PeriodicalId\":342914,\"journal\":{\"name\":\"2013 10th International Conference Computer Graphics, Imaging and Visualization\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International Conference Computer Graphics, Imaging and Visualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CGIV.2013.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Conference Computer Graphics, Imaging and Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGIV.2013.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了用切比雪夫多项式近似一条手写曲线的两种方法。首先，在算法1和算法2中介绍了两种不同的特征点选择技术。算法1使用频率，算法2使用拐点分析。然后，使用切比雪夫多项式逼近曲线，但由于曲线的端点是摆动的，因此必须通过算法3对新曲线进行调整。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Efficient Handwritten Curve Approximation by a Bezier Curve Using Chebyshev Polynomials

This paper presents two methodologies for approximating a handwritten curve by a Bézier curve using Chebyshev Polynomials. First, two different featured point selection techniques, are introduced in algorithms 1 and 2. Algorithm 1 uses frequency while algorithm 2 uses the analysis of inflection point. Then, using Chebyshev Polynomials for approximation curve, however a new curve must be adjusted by algorithm 3 because the end points of curve are swing.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 10th International Conference Computer Graphics, Imaging and Visualization

自引率

0.00%

发文量