{"title":"An Approach to Bézier Curve Approximation by Circular Arcs","authors":"Taweechai Nuntawisuttiwong, N. Dejdumrong","doi":"10.1109/JCSSE.2018.8457180","DOIUrl":null,"url":null,"abstract":"This paper presents a method to approximate Béziercurves by a sequence of arc splines with inscribed regular polygon. The proposed algorithm uses the arc length approximation method in subdividing a Bézier curve into subcurves which have equal arc length. Each subcurve is interpolated with a line segment which is a side of the inscribed polygon of a curve. Curve segments are then clustered into a circular arc by evaluating interior angles of inscribed polygon. This method represents a Bézier curve with the minimum number of circular arcs and acceptable errors. The experimental results are provided the similarity of original curve and approximated arc spline. The approximated arc spline which is the result of proposed algorithm is compatible for vector and raster graphic format.","PeriodicalId":338973,"journal":{"name":"2018 15th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2018.8457180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper presents a method to approximate Béziercurves by a sequence of arc splines with inscribed regular polygon. The proposed algorithm uses the arc length approximation method in subdividing a Bézier curve into subcurves which have equal arc length. Each subcurve is interpolated with a line segment which is a side of the inscribed polygon of a curve. Curve segments are then clustered into a circular arc by evaluating interior angles of inscribed polygon. This method represents a Bézier curve with the minimum number of circular arcs and acceptable errors. The experimental results are provided the similarity of original curve and approximated arc spline. The approximated arc spline which is the result of proposed algorithm is compatible for vector and raster graphic format.