A New Dynamic Programming Approach for Scan Conversion of a Circle

Generally curve may be generated as a sequence of many small lines; some curves like circle, parabola, ellipse, in particular can be generated with help of D.D.A. algorithm and other special algorithms. There are two main recursive algorithms for scan conversion of the circle on computer screen, the Bresenhams and the Midpoint circle generating algorithm both are pixel based; in this paper we are presenting a recursive new approach for scan conversion of the circle. The pixel in one octant has been determined with help of this algorithm and rest of the parts of the circle will be generated with help of symmetry. General Terms Dynamic Programming, Symmetry, Euclidean geometry, Octant

[1]  H. C. Liu,et al.  A New Approach for the Generation of Circles , 1993, Comput. Graph. Forum.

[2]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[3]  John E. Howland,et al.  Computer graphics , 1990, IEEE Potentials.

[4]  M. Carter Computer graphics: Principles and practice , 1997 .

[5]  Yasuhito Suenaga,et al.  A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs , 1979, IEEE Transactions on Computers.

[6]  Rae A. Earnshaw,et al.  Fundamental Algorithms for Computer Graphics , 1986, NATO ASI Series.

[7]  Robert F. Sproull,et al.  Using program transformations to derive line-drawing algorithms , 1982, TOGS.

[8]  Jack Bresenham,et al.  A linear algorithm for incremental digital display of circular arcs , 1977, CACM.

[9]  Zenon Kulpa A note on the paper by B. K. P. Horn: “Circle generators for display devices” , 1979 .

[10]  Alex T. Pang Line-drawing algorithms for parallel machines , 1990, IEEE Computer Graphics and Applications.

[11]  Jack E. Bresenham,et al.  Run Length Slice Algorithm for Incremental Lines , 1985 .

[12]  Berthold K. P. Horn Circle generators for display devices , 1976 .

[13]  James F. Blinn How Many Ways Can You Draw a Circle? , 1987, IEEE Computer Graphics and Applications.

[14]  William E. Wright,et al.  Parallelization of Bresenham's line and circle algorithms , 1990, IEEE Computer Graphics and Applications.

[15]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[16]  Jon G. Rokne,et al.  Hybrid Scan-Conversion of Circles , 1995, IEEE Trans. Vis. Comput. Graph..

[17]  James C. Miller,et al.  Computer graphics principles and practice, second edition , 1992, Comput. Graph..

[18]  M. Douglas McIlroy Best approximate circles on integer grids , 1983, TOGS.

[19]  James D. Foley,et al.  Fundamentals of interactive computer graphics , 1982 .

[20]  Mark Novak,et al.  Curve-drawing algorithms for Raster displays , 1985, TOGS.

[21]  Robert F. Sproull,et al.  Filtering edges for gray-scale displays , 1981, SIGGRAPH '81.

[22]  Xiaolin Wu,et al.  Double-step incremental generation of lines and circles , 1987, Comput. Vis. Graph. Image Process..