2D/3D line rendering using 3D rasterization algorithms

A device to compile a set of display points that define a two dimensional representation of a straight line graphic object using three dimensional rasterization algorithms, the device comprising:

• a three dimensional graphics accelerator having a drawing memory configured to receive data that defines three vertices (x0, y0, K0), (x1, y1, K1), and (x2, y2, K2) of a triangle primitive, where attributes K2=(K0+K1)/2, where coordinates (x0, y0), (x1, y1), and (x2, y2) form an isosceles triangle primitive, and where coordinates (x0, y0) and (x1, y1) define a base of the isosceles triangle primitive, and
• the three dimensional graphics accelerator further having a drawing processor configured to render the isosceles triangle primitive using three dimensional rasterization algorithms to obtain the set of display points that define a two dimensional representation of the base of the isosceles triangle primitive.

A device to compile a set of display points that define a two dimensional representation of a straight line graphic object using three dimensional rasterization algorithms, the device comprising:

• means for receiving data that defines three vertices (x0, y0, K0), (x1, y1, K1), and (x2, y2, K2) of a triangle primitive, where attributes K2=(K0+K1)/2, where coordinates (x0, y0), (x1, y1), and (x2, y2) form an isosceles triangle primitive, and where coordinates (x0, y0) and (x1, y1) define a base of the isosceles triangle primitive, and
• means for rendering the isosceles triangle primitive using three dimensional rasterization algorithms to obtain the set of display points that define a two dimensional representation of the base of the isosceles triangle primitive.

A method to compile a set of display points that define a two dimensional representation of a straight line graphic object using three dimensional rasterization algorithms, the method comprising:

• receiving data that defines three vertices (x0, y0, K0), (x1, y1, K1), and (x2, y2, K2) of a triangle primitive, where attributes K2=(K0+K1)/2, where coordinates (x0, y0), (x1, y1), and (x2, y2) form an isosceles triangle primitive, and where coordinates (x0, y0) and (x1, y1) define a base of the isosceles triangle primitive;
• and
• rendering the isosceles triangle primitive using three dimensional rasterization algorithms to obtain the set of display points that define a two dimensional representation of the base of the isosceles triangle primitive.