Patent US1764067A successfully refreshed from Google Patents.
Patent US5265199A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5265199A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for accomplishing Z-buffering by prediction

Assignee: Microsoft Technology Licensing LLC
•
Filing: 1991-05-22
•
Granted: 1993-11-23
•
Expires: 2011-05-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for accelerating the writing of data to a Z buffer including the steps of reading the Z value presently stored at a position in the Z buffer; writing a new Z value to the position in the Z buffer if the result of a last available comparison in a sequence of comparisons wrote a new Z value to a position in the Z buffer, writing the Z value read back to the position in the Z buffer if the result of a last available comparison in a sequence of comparisons wrote the Z value read back to a position in the Z buffer, and comparing the Z value read from the position of the Z buffer with the new Z value; and rewriting the correct value to the Z buffer if the comparison of the Z value read from the position of the Z buffer with the new Z value demonstrates that the value written was incorrect.

Inventors

  • 👤 Gary Catlin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 20:31
CPC Classifications
G; G06; G06T; G06T15/00; G06T15/10; G06T15/40; G06T15/405

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 209 words
A method including a series of steps practiced in a repeated sequence for accelerating the writing of data to a buffer memory used to store data indicating a depth of each pixel to be displayed on a display screen (a Z buffer), the series of steps of the method for storing a depth of each pixel in sequence including the steps of receiving a new Z value to be stored at a position, reading an old Z value presently stored at the position int he Z buffer; writing the same one of the old Z value or the new Z value to the position in the Z buffer as was written for an immediately preceding series of steps for storing a Z value of an immediately preceding pixel in the repeated sequence, comparing the old Z value at the position of the Z buffer wit the new Z value to be stored at the position; and rewriting the position of the Z buffer if the comparison of the old Z value read from the position of the Z buffer with the new Z value to be stored at the position demonstrates that the value written was farther from the display screen than the Z value which was not written.
Claim 2
Independent Claim 209 words
A method including a series of steps practiced in a repeated sequence for accelerating the writing of data to a buffer memory used to store data indicating a depth of each pixel to be displayed on a display screen (a Z buffer), the series of steps of the method for storing a depth of each pixel in sequence including the steps of receiving a new Z value to be stored at a position, reading an old Z value presently stored at the position int he Z buffer; writing the same one of the old Z value or the new Z value to the position in the Z buffer as was written for an immediately preceding series of steps for storing a Z value of an immediately preceding pixel in the repeated sequence, comparing the old Z value at the position of the Z buffer wit the new Z value to be stored at the position; and rewriting the position of the Z buffer if the comparison of the old Z value read from the position of the Z buffer with the new Z value to be stored at the position demonstrates that the value written was farther from the display screen than the Z value which was not written.
Claim 3
Dependent Claim 129 words
A method including a series of steps practiced in a repeated sequence for accelerating the writing of data to a buffer memory used to store data indicating a depth of each pixel to be displayed on a display screen (a Z buffer) as claimed in claim 1, the series of steps of the method for storing a depth of each pixel in sequence comprising the further step of stalling writing to additional positions of the Z buffer until the position has been rewritten if the comparison of the old Z value read from the position of the Z buffer with the new Z value to be stored at the position demonstrates that a value written was farther from the display screen than the Z value which was not written.
Claim 4
Independent Claim 147 words
A method for accelerating writing of data to a buffer memory where the writing to the buffer memory depends upon a comparison of old and new data at each position of the buffer memory and positions are written sequentially including the steps of reading an old value presently stored at a first position in the buffer memory, presenting a new value to be written to the first position in the buffer memory, and writing either the new value or the old value conditionally tot he first position in the buffer memory if a result of a last available comparison in a sequence of comparisons of old and new data at a position preceding the first position produced a similar result, and comparing the old value at the first position of the buffer memory with the new value to determine the correctness of the new value conditionally written.
Claim 5
Independent Claim 147 words
A method for accelerating writing of data to a buffer memory where the writing to the buffer memory depends upon a comparison of old and new data at each position of the buffer memory and positions are written sequentially including the steps of reading an old value presently stored at a first position in the buffer memory, presenting a new value to be written to the first position in the buffer memory, and writing either the new value or the old value conditionally tot he first position in the buffer memory if a result of a last available comparison in a sequence of comparisons of old and new data at a position preceding the first position produced a similar result, and comparing the old value at the first position of the buffer memory with the new value to determine the correctness of the new value conditionally written.
Claim 6
Dependent Claim 149 words
Apparatus for accelerating the writing of data to a buffer memory used to store data indicting a depth of each pixel to be displayed on a display screen (a Z buffer) including means for reading an old Z value presently stored at a position in the Z buffer; means for writing the same one of the old Z value or the new Z value to the position in the Z buffer as was written for an immediately preceding pixel means for comparing the old Z value read from the position of the Z buffer with the new Z value; and means for rewriting the position of the Z buffer if the comparison of the old Z value read from the position of the Z buffer with the new Z value demonstrates that the value written was farther from the display screen than the Z value which was not written.
Claim 7
Dependent Claim 149 words
Apparatus for accelerating the writing of data to a buffer memory used to store data indicting a depth of each pixel to be displayed on a display screen (a Z buffer) including means for reading an old Z value presently stored at a position in the Z buffer; means for writing the same one of the old Z value or the new Z value to the position in the Z buffer as was written for an immediately preceding pixel means for comparing the old Z value read from the position of the Z buffer with the new Z value; and means for rewriting the position of the Z buffer if the comparison of the old Z value read from the position of the Z buffer with the new Z value demonstrates that the value written was farther from the display screen than the Z value which was not written.
Claim 8
Dependent Claim 87 words
Apparatus for accelerating the writing of data to a buffer memory used to store data indicating a depth of each pixel to be displayed on a display screen (a Z buffer) as claimed in claim 4 in which the means for comparing the old Z value read from the position of the Z buffer with the new Z value includes a comparator circuit, and means for furnishing the new Z value and the old Z value read from the position of the Z buffer to the comparator.
Claim 9
Dependent Claim 143 words
Apparatus for accelerating the writing of data to a buffer memory used to store data indicating a depth of each pixel to be displayed on a display screen (a Z buffer) as claimed in claim 5 in which the means for rewriting the position of the Z buffer if the comparison of the old Z value read from the position of the Z buffer with the new Z value demonstrates that the value written was farther from the display screen than the Z value which was not written includes means for storing the old Z value read from the position of the Z buffer and the new Z value, and means for selecting the old Z value read from the position of the Z buffer or the new Z value depending on which Z value indicates a position closer to the display screen.
Claim 10
Dependent Claim 95 words
Apparatus for accelerating the writing of data to a buffer memory used to store data indicating a depth of each pixel to be displayed on a display screen (a Z buffer) as claimed in claim 4 further comprising means for stalling writing to additional positions of the Z buffer until the position has been rewritten if the comparison of the old Z value read from the position of the Z buffer with the new Z value demonstrates that a value written was farther from the display screen than the Z value which as not written.

References Cited (Backward Citations)

US3559183A Cited
US4477872A Cited
US4679041A Cited
US4991080A Cited
US5084830A Cited
US4951232A Cited
US5005117A Cited
US5043921A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-11-22 1997-05-24 1997-11-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-11-22 2001-05-24 2001-11-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-11-22 2005-05-24 2005-11-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag