Drawing lines by uniform packing

In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. While the conventional line drawing algorithms perform linear time computations to find the location of the pixels, our algorithm takes logarithmic time. Also, experimental results show that the quality of line is acceptable and comparable to the well-known Bresenham's line-drawing algorithm. r 2006 Elsevier Ltd. All rights reserved.

• Type: Journal
• Year: 2006
• Where: CG
• Authors: Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakht, Mohammad Kaykobad
• Keywords: CG 2006, Computer Graphics, Conventional Line, Horizontal Segments, Uniform Packing Density