CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A New Dynamic Programming Approach for Scan Conversion of a Circle

by Sushil Chandra Dimri, Sushil Kumar Chamoli, Anuj Dimri
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 50 - Number 17
Year of Publication: 2012
Authors: Sushil Chandra Dimri, Sushil Kumar Chamoli, Anuj Dimri
10.5120/7861-0964

Sushil Chandra Dimri, Sushil Kumar Chamoli, Anuj Dimri . A New Dynamic Programming Approach for Scan Conversion of a Circle. International Journal of Computer Applications. 50, 17 ( July 2012), 7-10. DOI=10.5120/7861-0964

@article{ 10.5120/7861-0964,
author = { Sushil Chandra Dimri, Sushil Kumar Chamoli, Anuj Dimri },
title = { A New Dynamic Programming Approach for Scan Conversion of a Circle },
journal = { International Journal of Computer Applications },
issue_date = { July 2012 },
volume = { 50 },
number = { 17 },
month = { July },
year = { 2012 },
issn = { 0975-8887 },
pages = { 7-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume50/number17/7861-0964/ },
doi = { 10.5120/7861-0964 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:49:03.595054+05:30
%A Sushil Chandra Dimri
%A Sushil Kumar Chamoli
%A Anuj Dimri
%T A New Dynamic Programming Approach for Scan Conversion of a Circle
%J International Journal of Computer Applications
%@ 0975-8887
%V 50
%N 17
%P 7-10
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Prasad, G. , and Gupta, H. C. , 1965 "Text Book on Coordinate Geometry" Edition-6, Pothishala, Allahabad.
  2. Bresenham, J. E. , 1977 "A linear algorithm for incremental digital display of circular arcs. " Comm. ACM, vol. 20. no. 2.
  3. Foley, J. D. , van Dam, A. , Feiner, S. K. , and Hughes, J. F. , 1996 "Computer Graphics: Principles and Practice", Second Edition in C, Addison Wesley.
  4. Gupta, S. R. and Sproull, R. , 1981 "Filtering Edges for Gray-Scale Display," SIGGRAPH 81, pp. 1-5.
  5. Pang, A. , 1990"Line-drawing Algorithms for Parallel Machines. " IEEE CG&A, 10, 9 (1990), pp. 54-59.
  6. Sproull, R. F. , 1982 "Using Program Transformations to Derive Line-Drawing Algorithms. " ACM trans. Gr. , 1, 10 (1982), pp. 259-273.
  7. Suenaga, Y. , Kamae, T. , and Kobayashi, T. ,1979"A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs. " IEEE Trans. Computer, C-28, 10 (1979), 728-736. Graphics, Vol. 6 No. 1, 1 (1982), pp. 15-17.
  8. Wu, X. and Rokne, J. G. "Double-Step Incremental Generation of Lines and Circles. " Comput. Vision, Gr. Image Process. 37, 3 (1987), pp. 331-344.
  9. Hearn, D. , Baker P. M. , 2001 "Computer Graphics" PHI Publication New Delhi.
  10. Rogers, D. , F. , 1998"Procedural element of Computer Graphics" McGraw-Hill.
  11. J. F. Blinn, 1987 "How many ways can you draw a circle?" IEEE Computer Graphics and Applications, pp. 39-44, Aug. , (1987).
  12. Bresenham, J. E. 1985 "Run length slice algorithms for incremental lines," Fundamental Algorithms for Computer Graphics, R. A. Earnshaw, ed. ,NATO Computer and Systems Series, vol. 17, pp. 59-104. New York: Springer-Verlag.
  13. Foley, J. D. and Dam, A. V. 1982 "Fundamentals of Interactive Computer Graphics", Reading, Mass. : Addison-Wesley.
  14. Fung, K. Y. , Nicholl, T. M. and Dewdney, A. K. , 1992 "A run- length & line drawing algorithm without division operations," Computer Graphics Forum, vol. 3, pp. 267-277.
  15. Horn, B. K. P. , 1976 "Circle generator for display devices," Computer Graphics and Image Processing, vol. 5, pp. 280-288.
  16. Hsu, S. Y. , Chow, L. R. and Liu, C. H. 1993 "A new approach for the generation of circles," Computer Graphics Forum 12, vol. 2, pp. 105-109.
  17. Kulpa, Z. 'A note on the paper by B. K. P. Horn. , 1979 "Circle generators for display devices,"' Computer Graphics and Image Processing, vol. 9, pp. 102-103.
  18. Mcllroy, M. D. , 1983 "Best approximate circles on integer grids," ACM Trans. Graphics, vol. 2, no. 4, pp. 237-263, Oct. (1983)
  19. Rokne, J. G. , 1990 , Wyvill, B. and Wu, X. "Fast line scat- conversion," ACM Trans. Graphics, vol. 9, no. 4, pp. 376-388, Oct. (1990).
  20. Van Aken J. R and Novak, M. , 1985 "Curve-drawing algorithms for raster display," ACM Trans. Graphics, vol. 4, no. 2, pp. 147-169, Apr. (1985).
  21. Wright, W. E. , 1990 "Parallelization of Bresenham's line and circle algorithms,"IEEE Computer Graphics and Applications, pp. 60-67, Sept. (1990).
  22. Wu, X. and Rokne, J. , 1987 "Double-step generation of lines and circles,"CVGIP, vol. 37, pp. 331-344.
  23. Yao, C. and Rokne, G. J. , 1995 "Hybrid scan conversion of Circles" IEEE Trancactions on Visualizations and Computer Graphics Vol. 1, No. 4.
Index Terms

Computer Science
Information Sciences

Keywords

Scan conversion decision parameter real theoretical point mid point algorithm

Powered by PhDFocusTM