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

Submit your paper
Know more
The week's pick
Responsive image
Adaptive Congestion Control Protocol based on Meta-Reinforcement Learning for Data Communication Networks

Mugoh Mwaura Stephen Kiambi Hezekiah Nganga
Random Articles
Reseach Article

Line Drawing Algorithm on an Interleaved Grid

by M.Prabukumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 19 - Number 4
Year of Publication: 2011
Authors: M.Prabukumar
10.5120/2353-3076

M.Prabukumar . Line Drawing Algorithm on an Interleaved Grid. International Journal of Computer Applications. 19, 4 ( April 2011), 1-7. DOI=10.5120/2353-3076

@article{ 10.5120/2353-3076,
author = { M.Prabukumar },
title = { Line Drawing Algorithm on an Interleaved Grid },
journal = { International Journal of Computer Applications },
issue_date = { April 2011 },
volume = { 19 },
number = { 4 },
month = { April },
year = { 2011 },
issn = { 0975-8887 },
pages = { 1-7 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume19/number4/2353-3076/ },
doi = { 10.5120/2353-3076 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:06:04.989018+05:30
%A M.Prabukumar
%T Line Drawing Algorithm on an Interleaved Grid
%J International Journal of Computer Applications
%@ 0975-8887
%V 19
%N 4
%P 1-7
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper Bresenham’s line drawing algorithm on interleaved grid is proposed. It uses the advantages of interleaved sampling to scan-convert the pixel on the raster with less representation error. The performance of the proposed algorithm is compared with the conventional Bresenham’s algorithm on square grid. The qualitative and quantitative analyses show that the proposed algorithm outperforms the Bresenham’s line drawing algorithm on square grid.

References
  1. Bresenham, J.E. Algorithm for computer control of a digital plotter, IBM Systems Journal, January 1965, pp. 25-30.
  2. J. D. Foley, A. van Dam, S. K. Feiner, and J. H. Hughes, Computer graphics: Principles and practice, Second edition, Addison-Wesley (1990).
  3. Donald Hearn, and M. Pauline Baker, Computer graphics, C Version, Second edition, Prentice-Hall (2005).
  4. R.M.Mersereau, "The processing of hexagonally sampled two dimensional signals," Proc. IEEE vol. 67 no. 6 pp.930-949, June 1979.
  5. R.C.Staunton, "Hexagonal image sampling, a practical proposition," Proc. SPIE vol. 1008 pp. 23-27, 1989.
  6. Luszak.E and Rosenfeld.A, Distance on a hexagonal grid, IEEE Transactions on Computers, 25(3), 532-533(1968).
  7. Wuthrich, C.A. and Stucki, P, An algorithm comparison between square- and hexagonal based grids. Graphical Models and Image Processing, 53(4), 324–339. (1991).
  8. Bimal kumar Ray, An alternative approach to circle drawing, Journal.Indian Institude of Science, 86,617-623(2006).
  9. Root mean square deviation, Internet source: http://en.wikipedia.org/wiki/Root_mean_square_deviation.html
  10. Least Squares Fitting, Internet source: http://mathworld.wolfram.com/LeastSquaresFitting.html.
Index Terms

Computer Science
Information Sciences

Keywords

Interleaved grids rasterizing scan conversion aliasing

Powered by PhDFocusTM