Z buffer bandwidth reductions via split transactions

Details Z buffer bandwidth reductions via split transactions Z buffer bandwidth reductions via split transactions

1996-06-10

1998-12-01

Fetting, Anton

Computer graphics processing and selective visual display system

Computer graphics processing

Three-dimension

G06T 1540

Patent

active

058445714

ABSTRACT:
In computer graphics systems, a view of scene of primitives is represented by pixel data associated with a set S of pixels. The present invention identifies whether a given primitive is visible at the set S of pixels by storing in a buffer, for each pixel P belonging to set S, a depth value Z.sub.old associated with the pixel P. The depth value Z.sub.old is partitioned into a plurality of portions including a most significant portion and at least one less significant portion. The buffer comprises a plurality of contiguous blocks each storing corresponding portions of the depth value Z.sub.old for a given set SP of consecutive pixels belonging to set S. A set SQ of consecutive pixels belonging to set S that cover the given primitive is determined. The most significant portion of the depth value Z.sub.old of the set SQ of consecutive pixels are fetched from the buffer. For each pixel Q belonging to set SQ, the most significant portion of the depth value Z.sub.old of the particular pixel is compared to the most significant portion of the computed depth value Z.sub.new of the particular pixel to determine if one of three conditions is satisfied: a) the given primitive is visible at the particular pixel, b) the given primitive is hidden at the particular pixel, or c) it is undetermined whether the given primitive is either visible or hidden at the particular pixel. If condition a) is satisfied, the blocks of the buffer associated with the particular pixel is updated to store the computed depth value Z.sub.new of the particular pixel. If condition b) is satisfied, the processing ends with respect to the particular pixel. If condition c) is satisfied, the fetching step and comparing step above is repeated for the next less significant portion of the depth values Z.sub.old and Z.sub.new associated with the particular pixel until the least significant portion of the depth values Z.sub.old and Z.sub.new has been processed.

REFERENCES:
patent: 5265214 (1993-11-01), Nitta
patent: 5268995 (1993-12-01), Diefendorff et al.
patent: 5278949 (1994-01-01), Thayer
patent: 5301263 (1994-04-01), Dowdell
patent: 5307450 (1994-04-01), Grossman
patent: 5459822 (1995-10-01), Izawa et al.
patent: 5467459 (1995-11-01), Alexander et al.
patent: 5542025 (1996-07-01), Brown
Foley et al., Computer Graphics: Principles and Practice, pp. 649-698, 1990.
"Emerging Memory Solutions for Graphics Applications", K. Suizu, T. Ogawa and K. Fujishima, IEICE Trans. Electron., vol. E78-C, No. 7, Jul. 1995, pp. 773-781.
"Computer Graphics, Principles and Practice", Second Edition, J.D. Foley, A. van Dam, S.K. Feiner and J.F. Hughes, Addison-Wesley Publishing Company .

Affiliated with

Also associated with

Rating

Z buffer bandwidth reductions via split transactions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Z buffer bandwidth reductions via split transactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Z buffer bandwidth reductions via split transactions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2399213