Polygon engine for updating computer graphic display employing compressed bit map data

• US 5,295,235 A
• Filed: 02/14/1992
• Issued: 03/15/1994
• Est. Priority Date: 02/14/1992
• Status: Expired due to Fees

• Current Assignee: Steve Newman
• Original Assignee: Steve Newman
• Inventors: Newman, Steve
• Primary Examiner(s): Herndon, Heather R.
• Assistant Examiner(s): Smith, Michael
• Application Number:
  US07/835,548
• Time in Patent Office: 760 Days
• Field of Search: 395/133, 395/122, 395/134, 395/123, 395/121, 395/131, 395/126, 382/56, 358/261.1
• US Class Current: 345/619
• CPC Class Codes: G06T 11/40 Filling a planar surface by adding surface attributes, e.g. colour or texture
• CPC Class Codes: G06T 15/80 Shading
• CPC Class Codes: G09G 5/393 Arrangements for updating the contents of the bit-mapped memory

Abstract

The polygon engine of this invention is a technique for rendering a computer graphic display using a compressed data format. A display list of objects for the next frame is converted into a list of spans for each horizontal line of the display. The polygon engine converts the list of spans for all objects into a set of run-length-encoded bit map lines for the next frame. Conflicts between overlapping objects are resolved based upon a depth value of the corresponding objects. Any remaining unspecified pixels are filled with a predetermined background color. Lastly, the polygon engine updates the frame buffer to correspond to this set of run-length-encoded bit map lines, preferably by comparing run-length-encoded bit map lines for the next frame with those for the current frame and writing only changed pixels into the frame buffer. An alternative embodiment of this invention uses compressed data in the form of trapezoids whose parallel sides are horizontal. A hardware extension of the polygon engine uses a run-length-encoded bit map frame buffer to specify the display.

Claims

1. A method of rendering a plurality of objects which form a computer graphic display into a frame buffer having a plurality of scan lines comprising the steps of:

specifying the objects into a list for the next frame of the display, each object comprising a plurality of pixels, each pixel of the object having an identical color;

converting each object of said list of objects into a list of spans, each span corresponding to a horizontal line of the display for the next frame, each span defining a group of horizontally adjacent pixels of a corresponding single object in terms of horizontal offset, pixel count, depth, and color;

merging said list of spans for all objects of said list of objects into a single master list of spans, whereby each span for each object for a particular horizontal line appears in said master list of spans for that horizontal line;

resolving the depth of said spans in said master list by choosing the color for each span of overlap from the overlapping span having the least depth value;

converting said master list of spans into a set of run-length-encoded bit map lines for the next frame, each run-length-encoded bit map line defining all sets of horizontally adjacent pixels having the same color, each set including the number of pixels and the color for that set; and

updating the frame buffer by writing each run-length-encoded bit map line into a corresponding scan line of the plurality of scan lines in the frame buffer.

2. The method of rendering a computer graphic display as claimed in claim 1, further comprising the step of:

sorting said list of objects for the next frame in left to right order prior to converting each object into a list of spans.

3. The method of rendering a computer graphic display as claimed in claim 1, wherein said step of converting said lists of spans for said list of objects into a set of run-length-encoded bit map lines for the next frame further includes:

sorting said spans for each horizontal line of said master list of spans in left to right order; and

filling any remaining unspecified pixels with a predetermined background color.

4. The method of rendering a computer graphic display as claimed in claim 1, wherein said step of updating the frame buffer includes:

comparing said set of run-length-encoded bit map lines for the next frame with the set of run-length-encoded bit map lines for the current frame to determined each pixel having a color different in the next frame than in the present frame; and

writing into corresponding locations in the frame buffer only the color in the next frame of those pixels having a color different in the next frame than in the present frame.

5. A method of rendering a computer graphic display into a frame buffer having a plurality of scan lines comprising the steps of:

specifying a list of polygons for the next frame of the display, each polygon having a corresponding color;

converting each polygon of said list of polygons into a set of trapezoids whose parallel sides are horizontal;

converting said set of trapezoids for all polygons of said list of polygons into a set of nonoverlapping trapezoids;

updating the frame buffer to correspond to said set of nonoverlapping trapezoids for the next frame by comparing the set of nonoverlapping trapezoids for the current frame with the set of nonoverlapping trapezoids for the next frame;

determining a set of difference trapezoids having a color different in the next frame than in the present frame; and

storing a corresponding color only into each pixel represented by said difference trapezoids.

6. The method of rendering a computer graphic display as claimed in claim 5, wherein said step of converting each polygon of said list of polygons into a set of trapezoids consists of drawing horizontal lines through said polygons such that at least one end point of each horizontal line is a vertex point of the polygon to which it is associated.

7. The method of rendering a computer graphic display as claimed in claim 5, further comprising the step of:

sorting said list of polygons for the next frame in left to right order prior to converting each polygon into a set of trapezoids.

8. The method of rendering a computer graphic display as claimed in claim 5, wherein:

said step of converting said set of trapezoids for all polygons of said list of polygons into a set of nonoverlapping trapezoids includes

assigning a depth value to each trapezoid of the set of trapezoids converting from each polygon of said list of polygons.

9. The method of rendering a computer graphic display as claimed in claim 8, wherein:

said step of converting the set of trapezoids for all polygons of said list of polygons into a set of nonoverlapping trapezoids includes

comparing depth values for overlapping trapezoids and discarding trapezoids with larger depth values.

10. The method of rendering a computer graphic display as claimed in claim 5, wherein said step of updating the frame buffer includes:

filling any pixels not within said set of nonoverlapping trapezoids for the next frame with a predetermined background color.

11. The method of rendering a computer graphic display as claimed in claim 5, wherein said step of updating the frame buffer includes:

storing a corresponding color into each pixel of each of said nonoverlapping trapezoids for the next frame using special purpose polygon filling hardware.

12. The method of rendering a computer graphic display as claimed in claim 5, wherein said step of updating the frame buffer includes:

rendering each nonhorizontal side of each of said set of nonoverlapping trapezoids in the next frame in expanded pixels at an expanded scale relative to the frame buffer, whereby plural expanded pixels correspond to a single pixel in the frame buffer, and

writing into each pixel in the frame buffer corresponding to the nonhorizontal side of each of said set of nonoverlapping trapezoids in the current frame a combination of the color of each of the trapezoids on either side of the nonhorizontal side of each of said set of nonoverlapping trapezoids.

13. The method of rendering a computer graphic display as claimed in claim 5, each trapezoid comprised of a plurality of individual pixels each having a color, wherein the step of converting said set of trapezoids for all polygons of said list of polygons into a set of nonoverlapping trapezoids is accomplished by choosing the color for each trapezoid of overlap from the overlapping trapezoid having the least depth value.