Consider a line f(x) = mx + b, 0 ≤ m ≤ 1. Conventional line drawing algorithms sample (x, f(x)) on the line, where x must be an integer, and then map (x, f(x)) to the frame buffer according to the defined filter and f(x). In this paper, we propose to simulate a sampled point (x, f(x)) by the four pixels around it where x and f(x) are not necessary to be integers. Based on the proposed low-pass filtering, we show that the effect of sampling at infinite number of points along a line segment can be achieved since the closed form of the intensities assigned to pixels exists. Furthermore, we show the coherence properties that can reduce the cost for computing these intensities.
- Computer graphics
- Line drawing algorithm