ACM Home Page
Please provide us with feedback. Feedback
Drawing antialiased cubic spline curves
Full text PdfPdf (1.45 MB)
Source ACM Transactions on Graphics (TOG) archive
Volume 10 ,  Issue 1  (January 1991) table of contents
Pages: 92 - 108  
Year of Publication: 1991
ISSN:0730-0301
Author
R. Victor Klassen  Xerox Corp., Webster, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 70,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/99902.99906
What is a DOI?

ABSTRACT

Cubic spline curves have many nice properties that make them desirable for use in comptuer graphics, and the advantages of antialiasing have been known for some years. Yet, only recently has there been any attempt at directly antialiasing spline curves. Parametric spline curves have resisted antialiasing in several ways: single segments may cross or become tangent to themselves. Cusps and small loops are easily missed entirely. Thus, short pieces of the curve cannot necessarily be rendered in isolation. Finding the distance from a pixel center to the curve accurately and efficiently—usually an essential part of antialiasing—is an unsolved problem. The method presented by Lien, Shantz, and Pratt [21] is a good start, although it considers pixel-length pieces of the curve in isolation and lacks robustness in the handling of certain curves. This paper provides an improved method that is more robust, and is able to handle intersections and tangency.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
4
 
5
DECASTELJAU, P. Courbes et surface i2 P61es. Citr6en, Paris, 1959.
 
6
 
7
FIELD, D. Two algorithms for drawing anti-aliased lines. In Proceedings GI '84 {May 1984). Canadian Information Processing Society, 1984, 87-89.
8
 
9
 
10
FORREST, A. R. Antialiasing in practice. In Fundamental Algorithms in Computer Graphics, R. A. Earnshaw, Ed., Springer-Verlag, Berlin, 1985, 113-134.
 
11
FUJIMOTO, A., AND IWATA, K. Jag-free images on raster displays. IEEE Comput. Gr. AppL 3 (Dec. 1983), 26-34.
 
12
GONCZAROWSKI, J. Fast generation of unfilled and filled outline characters. In Proceedings of RIDT '89 (Oct. 1989). Cambridge University Press, 1989, 97-110.
13
 
14
15
 
16
KNUTH, D. E. METAFONT, a system for alphabet design. In TEX and Metafont: New Directions in Typography, American Mathematical Society and DIGITAL Press, 1979.
 
17
18
 
19
LANE, J., AND RIESENFELD, g. A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Trans. Pattern Anal. Mach. lnteU. PAMI-2, 1 (Jan. 1980), 35-46.
20
21
 
22
 
23
NI, G., AND TANNER, P. The application of anti-aliased technique for displaying high quality Chinese characters. In Proceedings of the 1982 International Conference of the Chinese Language Computer Society (Sept. 1982), 37-45.
24
25
26
27
28
29



REVIEW

"C. A. Neff : Reviewer"

When drawing cubic spline curves or even lines on a screen that consists of a discrete grid of pixels, the process of translation from continuous to discrete introduces visual artifacts even when the translation is done to single-p  more...


Peer to Peer - Readers of this Article have also read: