|
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
|
BADLER, N.I. Disk generation for a raster display device. Comput. Gr. Image Process. 6, 4 (Aug. 1977), 589-593.
|
 |
2
|
|
| |
3
|
DOROS, M. Algorithms for generation of discrete circles, rings, and disks, Comput. Gr. Image Process. 10, 4 (Aug. 1979), 366-371.
|
 |
4
|
|
| |
5
|
HARDY, G. H., AND WRIGHT, E.M. An Introduction to the Theory of Numbers. Oxford Univ. Press, London (1971), Theorem 244.
|
| |
6
|
HORN, B. K.P. Circle generators for display devices. Comput. Gr. Image Process. 5, 2 (June 1976), 280-288.
|
| |
7
|
JORDAN, B. W., LENNON, W. J. AND HOLM, B.D. An improved algorithm for the generation of nonparametric curves, IEEE Trans. Comput. C-22, 12 (Dec. 1973), 1052-1060.
|
| |
8
|
KAMAE, T., KOSUGI, M. AND HOSHINO, T. Dot display of simple grapics. Trans. IECE Japan 56-A, 7 (1973), 401-408, (in Japanese, quoted in {13}).
|
| |
9
|
KULPA, Z. On the properties of discrete circles, rings, and disks. Comput. Gr. Image Process. 10, 4 (Aug. 1979), 348-365.
|
| |
10
|
KULPA, Z., AND DOROS, M. Freeman digitization of integer circles minimizes the radial error. Comput. Gr. Image Process. 17, 2 (Oct. 1981), 181-184.
|
| |
11
|
LANE, M. More Needlepoint by Design. Scribners, New York (1972).
|
| |
12
|
PITTEWAY, M. L.V. Algorithms for drawing ellipses or hyperbolae with a digital plotter. Comput. J. 10, (1967), 282-289.
|
| |
13
|
SUENAGA, Y., KAMAE, T. AND KOBAYASHI, T. High-speed algorithm for the generation of straight lines and circular arcs. IEEE Trans. Comput. C-28, 10 (Oct. 1979), 728-736.
|
| |
14
|
Sutherland, I.E. SKETCHPAD--A man-machine graphical communication system. In Proceedings of the Joint Computer Conference (Detroit, Mich., May, 1963), pp. 335-352.
|
REVIEW
"Varol Akman : Reviewer"
This is an extremely well-written paper which will probably be the major
reference when it comes to the grid-following algorithms for drawing circles.
However, here is my criticism: Is this really a very important problem? Who
needs 26 pages on
more...
|