BEZIER CURVE TREE

This paper presents the tree representation of Bezier spline to support the geometric operations efficiently. A Bezier spline is first subdivided into pieces by use of de Casteljau algorithm and then a balanced binary tree is constructed to store them. Geometric operators on the curve can then be computed in a hierarchical manner. The operators are computed at a coarse resolution and the resolution is increased where necessary. In this way, the operators on the curve can be computed efficiently.