A new algorithm for creating Bézier curve
Li Liu
Abstract
Li Liu
Abstract
The existing algorithms of creating Bezier curve, such as polygon cutting algorithm and unique step algorithm, cannot ensure the minimum quantity of the produced polygons. This paper presents a new algorithm for creating Bezier curve, in which the approximation polygon created is of the least straight line segments. A comparison is made between the new algorithm and the existing ones by examples.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The existing algorithms of creating Bezier curve, such as polygon cutting algorithm and unique step algorithm, cannot ensure the minimum quantity of the produced polygons. This paper presents a new algorithm for creating Bezier curve, in which the approximation polygon created is of the least straight line segments. A comparison is made between the new algorithm and the existing ones by examples.
Key concepts: Polygon (computer graphics), Bézier curve, Algorithm, Polygonal chain, Polygon covering, Rectilinear polygon, Computer science, Mathematics