This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Performance of Curve Representation Schemes
May/June 1993 (vol. 13 no. 3)
pp. 55-63

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.

1. D.H. Ballard, "Strip Trees: A Hierarchical Representation for Curves,"CACM, May 1981, pp. 310-321 (see also corrigendum,CACM, Mar. 1982, pp. 213).
2. P.E. Bézier, "Mathematical and Practical Possibilities of Unisurf," inComputer-Aided Geometric Design, R.E. Barnhill and R. Riesenfeld, eds., Academic Press, New York, 1974, pp. 127-152.
3. T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.
4. G. Farin,Curves and Surfaces for Computer Aided Geometric Design, Academic Press, Boston, 1988.
5. O. Günther and E. Wong, "The Arc Tree: An Approximation Scheme to Represent Arbitrary Curved Shapes,"Computer Vision, Graphics, and Image Processing, Vol. 51, No. 3, Sept. 1990, pp. 313- 337.
6. T.W. Sederberg and S.R. Parry, "Comparison of Three Curve Intersection Algorithms,"Computer-Aided Design, Jan./Feb. 1986, pp. 58-63.
7. P.A. Koparkar and S.P. Mudur, "A New Class of Algorithms for the Processing of Parametric Curves,"Computer-Aided Design, Vol. 15, No. 1, Jan. 1983, pp. 41-45.
8. J. Hoschek and D. Lasser,Grundlagen der geometrischen Datenverarbeitung [Fundamentals of Computer-Aided Geometric Design], Teubner, Stuttgart, 1989.
9. Q.S. Peng, "An Algorithm for Finding the Intersection Lines Between Two B-spline Surfaces,"Computer-Aided Design, Vol. 16, No. 4, July 1984, pp. 191-196.
10. T.W. Sederberg and T. Nishita, "Curve Intersection Using Bézier Clipping,"Computer-Aided Design, Vol. 22, No. 9, Nov. 1990, pp. 538-549.
11. F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
12. T.W. Sederberg and R.J. Meyers, "Loop Detection in Surface Patch Intersections,"Computer Aided Geometric Design, Vol. 5, No. 2, July 1988, pp. 161-171.

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.210492
Usage of this product signifies your acceptance of the Terms of Use.