Method and apparatus for simultaneous parallel query graphics rendering Z-coordinate buffer

• US 5,596,686 A
• Filed: 04/21/1994
• Issued: 01/21/1997
• Est. Priority Date: 04/21/1994
• Status: Expired due to Term

• Current Assignee: Apple Inc.
• Original Assignee: Silicon Engines Incorporated
• Inventors: Duluk, Jerome F. Jr.
• Primary Examiner(s): Zimmerman, Mark K.
• Application Number:
  US08/231,251
• Time in Patent Office: 1,006 Days
• Field of Search: 395/122, 395/157, 395/164, 395/165, 395/166
• US Class Current: 345/422
• CPC Class Codes: G06T 15/405 using Z-buffer
• CPC Class Codes: G06T 2210/12 Bounding box

Abstract

Apparatus and method for a Parallel Query Z-coordinate Buffer are described. The apparatus and method perform a keep/discard decision on screen coordinate geometry before the geometry is converted or rendered into individual display screen pixels by implementing a parallel searching technique within a novel z-coordinate buffer based on a novel magnitude comparison content addressable memory (MCCAM) structure. The MCCAM provides means for performing simultaneous arithmetic magnitude comparisons on numerical quantities. These arithmetic magnitude comparisons include arithmetic less-than, greater-than, less-than-or-equal-to, and greater-than-or-equal-to operations between coordinate values of a selected graphical object and the coordinate values of other objects in the image scene which may or may not occult the selected graphical object. Embodiments of the method and apparatus utilizing variations of bounding box occulting tests, vertex bounding box occulting tests, span occulting tests, and raster-write occulting tests, as well as combinations of these tests are described.

Claims

1. A method of writing graphics images from a set of geometry data stored in a data memory to rasterized pixel data stored in a frame buffer for presentation on a display screen, said method comprising the steps of:

storing a number for use as a z-coordinate value with each image pixel location represented by said frame buffer in a magnitude comparison content addressable memory buffer;

selecting a geometry data item having at least one z-coordinate value from said set of geometry data stored in said data memory;

generating a bounding box around said selected geometry data;

determining a minimum z-coordinate value of said selected geometry data;

simultaneously performing for each of a plurality of pixels, prior to generation of pixel raster data from said selected geometry data, an arithmetic magnitude comparison between said minimum z-coordinate value and previously stored z-coordinate values associated with each of said plurality of pixels of previously selected geometry data currently stored on a pixel-by-pixel basis in said magnitude comparison content addressable memory buffer; and

discarding on a pixel-by-pixel basis, prior to generation of pixel raster data from said selected geometry data, a portion of said selected geometry data for which said minimum z-coordinate value is greater than said previously stored z-coordinate values within said bounding box so that said discarded portion of said selected geometry data is not written to said frame buffer.

2. The method of claim 1, wherein said bounding box generated in said generating step is a minimum sized rectangle in a viewing plane defined by said display screen which covers the area covered by said selected geometry data.

3. The method of claim 1, further comprising the step of:

replacing said previously stored z-coordinate values in said magnitude comparison content addressable memory buffer with the z-coordinate values of said selected geometry data when said minimum z-coordinate value is less than said previously stored z-coordinate values.

4. The method in claim 1, wherein said step of simultaneously performing said plurality of arithmetic magnitude comparisons between said minimum z-coordinate value and said previously stored z-coordinate values of previously selected geometry data comprises simultaneously performing said arithmetic magnitude comparisons between said minimum z-coordinate value and all of said previously stored z-coordinate values.

5. The method of claim 1, wherein said arithmetic magnitude comparison operations are selected from the group consisting of a greater-than arithmetic operation, a greater-than-or-equal-to arithmetic operation, a less-than arithmetic operation, and a less-than-or-equal-to arithmetic operation.

6. The method of claim 1, further comprising the steps of:

storing a plurality of words, each of said words comprising a plurality of data fields, each of said data fields being divided into a plurality of data bits;

providing an input comprising a plurality of input fields matching some of said data fields, and dividing each said input into input bits so as to have a one-to-one bit correspondence to the said data bits in said data fields in said words;

simultaneously comparing said plurality of input fields to all said words such that each said data field is compared to its corresponding said input, and for simultaneously generating a query result for each said word which is true when all said data fields within said word which are compared to one of said inputs compare favorably to each corresponding said input;

flag memory means for storing a flag bit equal to said query result for each of said words;

writing data to multiple words of said magnitude comparison content addressable memory simultaneously; and

performing multiple simultaneous queues of words of said magnitude comparison content addressable memory.

7. The method in claim 1, wherein each said number stored in said magnitude comparison content addressable memory buffer for use as a z-coordinate value is a number indicating that said z-coordinate value is at an infinite distance from the viewing eyepoint.

8. The method of claim 1, wherein said magnitude comparison test comprises applying a comparison test to all pixels previously stored in the MCCAM z-buffer and generating said first boolean value for each pixel when the following formula is satisfied as false:

space="preserve" listing-type="equation">Pixel(x,y)=0 if [(x<

x.sub.min)(x>

x.sub.max)(y<

y.sub.min)(y>

y.sub.max)(z<

z.sub.min)].

9. The method of claim 8, wherein said boolean value is generated from separate comparison result generating steps for each of the inequalities x<

x_min, x>

x_max, y<

Y_min, y>

y_max, and z<

z_min.

10. The method of claim 9, wherein said occulting test uses a comparison apparatus of said MCCAM z-buffer to determine if said bounding box is occulted by previously rasterized geometry;

and wherein said comparison apparatus comprises;

means for performing the arithmetic less-than operation between said x and said x_min to generate an x_min comparison result;

means for performing the arithmetic greater-than operation between said x and said x_max to generate an x_max comparison result;

means for performing the arithmetic less-than operation between said y and said y_min to generate an y_min comparison result;

means for performing the arithmetic greater-than operation between said y and said y_max to generate an y_max comparison result;

means for performing the arithmetic less-than operation between said z and said z_min to generate an z_min comparison result; and

logic means receiving said comparison results and generating an occultation result based on said comparison results and predetermined rules.

11. The method of claim 10, wherein each said arithmetic less-than operation between said z and said z_min comparison is performed simultaneously including comparisons for pixels outside said projected bounding box;

whereby the value of occulted is determined in an amount of time independent of both the number of pixels or the size of the projected bounding box.

12. The method of claim 11, wherein said bounding box occulting test further comprises the steps of:

terminating said occulting test at any time occulted is set to false; and

testing only pixels within a projected bounding box for which xmin≦

x≦

xmax and ymin≦

y≦

ymax.

13. The method in claim 10, wherein said MCCAM z-buffer comprises means for writing said z-fields while maintaining said x-fields and said y-fields fixed.

14. The method in claim 10, wherein said MCCAM further comprises means for performing a raster-write operation to simultaneously write a fixed z-value to multiple words of said MCCAM, and wherein said multiple words comprise words adjacent along a display raster line.

15. The method in claim 1, further comprising the step of temporally correlating a sequence of image scenes through the use of tag pointers to source geometry stored in a tag field within said MCCAM z-buffer.

16. The system of claim 1, wherein said display screen pixels are divided into a plurality of sub-image blocks;

and wherein said system comprises a plurality of magnitude comparison content addressable memory z-buffers arranged in parallel, each said magnitude comparison content addressable memory z-buffers processing data for one of said sub-image blocks;

said parallel arrangement of magnitude comparison content addressable memory z-buffers operating to increase the overall input/output capability said system over that provided by a single magnitude comparison content addressable memory z-buffer.

17. A graphics rendering system comprising:

a magnitude comparison content addressable memory for (i) receiving coordinate values including numerical z-coordinate values of corresponding geometry data, and (ii) for performing simultaneous arithmetic magnitude comparisons between a plurality of said received coordinate values with previously stored coordinate values in said magnitude comparison content addressable memory, and (iii) for generating an occulting signal representing results from said plurality of arithmetic magnitude comparisons of said received coordinate values with said stored coordinate values, and (iv) for updating said stored coordinate values in response to a result of said arithmetic magnitude comparisons;

a processor coupled to said magnitude comparison content addressable memory for processing said geometry data responsive to said generated occulting signal from said magnitude comparison content addressable memory; and

a frame buffer coupled to said processor for storing said processed geometry data from said processor.

18. The graphics rendering system recited in claim 17 further comprising:

a z-buffer for storing actual z-coordinate values corresponding to said coordinate values of said geometry data from said processor; and

wherein said z-coordinate values stored in said magnitude comparison content addressable memory are approximate z-coordinate values of said geometry data, said approximate z-coordinate values being greater-than-or-equal-to said actual z-coordinate value so that when a new geometry data is compared to said stored approximated z-coordinate value then said new geometry data is never declared occulted based on said approximated Z-coordinate value if it would not be declared occulted based on said actual z-coordinate value.

19. The graphics rendering system of claim 17, wherein said magnitude comparison content addressable memory (MCCAM) further comprises:

means for storing a plurality of words, each of said words comprising a plurality of data fields, each of said data fields being divided into a plurality of data bits;

means for providing an input to said MCCAM, said input comprising a plurality of input fields matching some of said data fields, each said input being divided into input bits so as to have a one-to-one bit correspondence to said data bits in said data fields;

query means for simultaneously comparing said plurality of input fields to all of said words so that each said data field is compared to its corresponding input field, and for simultaneously generating a query result for each said word which result is true only when all said data fields within said word compare favorably to each corresponding said input;

said query means including arithmetic magnitude comparator means associated with each said word storing a pixel z-value for comparing said stored pixel z-value with a reference value; and

flag memory means for storing a flag bit equal to said query result for each of said words.

20. The system of claim 19, wherein:

said magnitude comparison content addressable memory further comprises means for writing data to multiple words of said magnitude comparison content addressable memory simultaneously; and

means for performing multiple simultaneous queries of words of said magnitude comparison content addressable memory;

whereby the number of clock cycles needed to process geometry data is reduced.

21. The graphics rendering system in claim 17, wherein said magnitude comparison content addressable memory for performing simultaneous arithmetic magnitude comparisons between a plurality of said received coordinate values with previously stored coordinate values in said magnitude comparison content addressable memory comprises:

means for performing simultaneous arithmetic magnitude comparisons between all of said received coordinate values with said previously stored coordinate values in said magnitude comparison content addressable memory; and

wherein said arithmetic magnitude comparisons operations are selected from the group consisting of a greater-than arithmetic operation, a greater-than-or-equal-to arithmetic operation, a less-than arithmetic operation, and a less-than-or-equal-to arithmetic operation.

22. A method of converting imagery in the form of a set of geometry data stored in a data memory to rasterized pixel data stored in a frame buffer for presentation on a display screen, said method comprising the steps of:

storing a number for use as a z-coordinate value with each image pixel represented by said frame buffer in a storage location within a magnitude comparison content addressable memory buffer;

selecting a geometry data item having at least one z-coordinate value from said set of geometry data;

generating an approximating boundary characterization of said selected geometry data based on coordinate parameters of said selected geometry data;

determining a minimum z-coordinate value of said selected geometry data;

simultaneously performing for each of pixel in said image an arithmetic magnitude comparison test between said geometry object minimum z-coordinate value and said stored z-coordinate values of said image pixels; and

discarding on a pixel-by-pixel basis, any portion of said selected geometry data for which said minimum z-coordinate value is greater than said previously stored z-coordinate values within said boundary characterization prior to rasterization of said selected geometry data.

23. The method of claim 22, wherein said comparison test is performed for every pixel in the display screen, and further comprising the steps of:

setting, for each pixel prior to performing said comparison test, an occulted parameter to true to indicate that the geometrical location associated with said pixel is occulted;

determining the current z-coordinate value for said pixel;

determining whether said pixel is within said projected bounding box, and if said pixel is within said projected bounding box, then comparing said z-coordinate value to z_min ;

if z_min is not greater that said z-coordinate value of said evaluating pixel, then setting said occulted parameter to false for said pixel indicating that said new geometry may not be occulted and required additional processing to determine whether said geometry is occulted or not; and

wherein every pixel is evaluated for occultation simultaneously in a predetermined number of clock cycles independent of the number of pixels and independent of the size of the projected bounding box.

24. The method of claim 23, wherein said predetermined number of clock cycles is one clock cycle.

25. The method of claim 24, wherein said method further comprises the steps of:

terminating said bounding box occulting test whenever a pixel is determined not to be occulted and said occulted value is set to false; and

testing only pixels within said projected bounding box rather than all of said pixels within said display screen.

26. The method of claim 24, wherein said comparison tests are performed for all pixels in said display screen simultaneously and in parallel to search and determine if any piece of geometry is occulted, so that an entire object is tested to determine if it is occulted before said object is rasterized into pixels so that if it is determined that said entire object is occulted then all of the computations for converting the object geometry to pixels are avoided.

27. The method of claim 23, wherein said occulting test further comprises the steps of:

storing geometrical parameters for each pixel in a word in a data structure, said word including an x-field for storing and comparing the pixel x-value, a y-field for storing and comparing the pixel y-value, a z-field for storing and comparing the pixel z-value, and a logic field for storing and generating result signals including a pixel miss signal.

28. The method of claim 27, wherein said word further includes an infinity flag field for indicating that the z-value of the associated pixel is infinity, thus causing the pixel to be further away from the viewing point than any geometry could be located;

whereby said infinity field for all pixels may be set in parallel and thereby eliminate any need to separately write each z-value with a large value;

said infinity flag being cleared whenever a new z-value is written to the associated pixel; and

wherein said magnitude comparison test comprises applying a comparison test to all pixels previously stored in said magnitude comparison content addressable memory (MCCAM) z-buffer and generating said first boolean value for each pixel when the following formula is satisfied as false;

space="preserve" listing-type="equation">Pixel(x,y)=0 if [(x<

x.sub.min)(x>

x.sub.max)(y<

y.sub.min)(y>

y.sub.max){(z<

z.sub.min)NOT(Infinity.sub.-- Flag)}].

29. The method of claim 28, further comprising the steps of:

tagging pixels generating a first boolean value indicating said pixel is not occuoted for a subsequent processor to use in rendering temporally related scenes.

30. The method of claim 29, further comprising the steps of:

grouping said tagged pixels together into segments along a display raster line.