Abstract
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.
Full Text
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call