Line Drawing Algorithm on an Interleaved Grid | Zendy

Prabukumar Manoharan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Line Drawing Algorithm on an Interleaved Grid

Author(s) -

Prabukumar Manoharan

Publication year - 2011

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/2353-3076

Subject(s) - computer science , raster graphics , grid , algorithm , representation (politics) , line (geometry) , sampling (signal processing) , pixel , square (algebra) , artificial intelligence , computer vision , mathematics , filter (signal processing) , geometry , politics , political science , law

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research