Subscribe

Issue No.03 - May/June (1993 vol.13)

pp: 55-63

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.210492

ABSTRACT

<p>The performance of three curve representation schemes are compared. They are the strip-tree, Bezier-curve-employing, and arc-tree methods. Each scheme represents a curved shape as a hierarchy of approximations, where higher levels in the hierarchy correspond to coarser approximations of the curve. In addition, each approximation typically corresponds to a bounding area that encloses the actual curve. When geometric operations are computed, coarse approximation of the curve are initially addressed and finer approximation levels are processed if necessary. It is shown that the three representations differ in the choice of bounding areas, the type and amount of information stored at each approximation level, and the method of deciding whether to proceed to finer approximations.</p>

CITATION

Oliver Gunther, Salvador Dominguez, "The Performance of Curve Representation Schemes",

*IEEE Computer Graphics and Applications*, vol.13, no. 3, pp. 55-63, May/June 1993, doi:10.1109/38.210492REFERENCES