Lokesh Madan
Department of Computer Science, Dronacharya College of Engineering, Gurgaon, India
Kislay Anand
Department of Computer Science, Dronacharya College of Engineering, Gurgaon, India
Bharat Bhushan
Department of Computer Science, Dronacharya College of Engineering, Gurgaon, India
Download PDFLine drawing on discrete graphics devices such as raster video displays, plotters, and image printers is one of the fundamental operations in computer graphics. Real-time interactive applications or high speed image output (such as on a Postscript laser printer) may require line drawing speeds in the millions of pixels per second. Such demands, which are ever increasing, push the efficiency of line generation. For nearly thirty years Bresenham’s algorithm has been the standard which subsequent efforts inline drawing have sought to surpass. The basic ”line drawing” algorithm used in computer graphics is Bresenham’s Algorithm. This paper describes a hybrid method which uses structural properties of raster lines, such as runs, to improve the efficiency of multi-point line generation. A quadruple-step algorithm is developed which requires fewer decision tests than other multi-point algorithms, while retaining the multi-point’s advantage in pixel output efficiency, particularly when implemented in hardware. Abstract. Bresenham’s algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization.
Keywords: Computer graphics, Multimedia, Algorithm,Flash movie, ActionScript , Rasterization, ScanConversion
Disclaimer: All papers published in IJRST will be indexed on Google Search Engine as per their policy.
