Some researches have investigated that a Bézier curve can be treated as circular arcs. This work is to proposea new scheme for approximating an arbitrary degree Bézier curve by a sequence of circular arcs. The sequenceof circular arcs represents the shape of the given Bézier curve which cannot be expressed using any other algebraicapproximation schemes. The technique used for segmentation is to simply investigate the inner anglesand the tangent vectors along the corresponding circles. It is obvious that a Bézier curve can be subdivided intothe form of subcurves. Hence, a given Bézier curve can be expressed by a sequence of calculated points on thecurve corresponding to a parametric variable t. Although the resulting points can be used in the circular arcconstruction, some duplicate and irrelevant vertices should be removed. Then, the sequence of inner angles arecalculated and clustered from a sequence of consecutive pixels. As a result, the output dots are now appropriateto determine the optimal circular path. Finally, a sequence of circular segments of a Bézier curve can be approximatedwith the pre-defined resolution satisfaction. Furthermore, the result of the circular arc representationis not exceeding a user-specified tolerance. Examples of approximated nth-degree Bézier curves by circular arcsare shown to illustrate efficiency of the new method.