Computer graphics processing and selective visual display system – Computer graphics processing – Graphic manipulation
Reexamination Certificate
2007-11-06
2007-11-06
Tung, Kee M. (Department: 2628)
Computer graphics processing and selective visual display system
Computer graphics processing
Graphic manipulation
C345S592000, C345S630000, C345S631000
Reexamination Certificate
active
10875199
ABSTRACT:
Disclosed is an imaging engine system (699) generally intended for the reproduction of graphical object images using apparatus having limited computing resources, such as so-called “thin clients”. Numerous developments of traditional image processing and rendering enable high quality image generation. One such development takes advantage of temporal coherence between one frame in an animation sequence and the succeeding frame. In particular, there will often be some edges (233, 235) of graphical objects that remain “static” across several contiguous frames. One example of this includes those edges used to draw image background detail. Another development performs antialiasing during scan line rendering of a graphic object image where sub-pixel resolution coverage bit-masks (A-buffers29-34) are generated for a limited number of scan lines at a time. Preferably the A-buffers are generated for only one pixel at a time. Another development relates to rendering a scan line of a graphic object image in a scan line renderer for a span of pixels lying between two x-order consecutive edges intersecting the scan line. For the span of pixels, this development maintains a subset of depths present in the rendering, the subset being those depths that are present on the span and being maintained in depth order (590) and subject to removal of depths where the corresponding depth is no longer active. In another development a compositing stack (6101-6107) of image layers to be rendered in a raster scan fashion is simplified. Rendering is operable over a run of two or more pixels within which a relationship between graphical objects contributing to the layers does not change. The layers are first divided into groups (6110, 6112, 6114), with each group being separated by a layer having variable transparency (6111, 6113). For a top one of the groups, layers having constant color in the run are reduced to a single equivalent color (6115, 6116, 6117) having an associated accumulated contribution. Many other developments are disclosed.
REFERENCES:
patent: 5115402 (1992-05-01), Matsushiro et al.
patent: 5483627 (1996-01-01), Silverbrook et al.
patent: 5990904 (1999-11-01), Griffin
patent: 6028583 (2000-02-01), Hamburg
patent: 6057855 (2000-05-01), Barkans
patent: 6128000 (2000-10-01), Jouppi et al.
patent: 6362818 (2002-03-01), Gardiner et al.
patent: 6369828 (2002-04-01), Lewis
patent: 6369830 (2002-04-01), Brunner et al.
patent: 11/283047 (1999-10-01), None
patent: 2000-149053 (2000-05-01), None
patent: WO 00/68887 (2000-11-01), None
patent: WO 03/065310 (2003-08-01), None
M. D. Ercegovac et al., “Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers”, IEEE Transactions on Computers, vol. 49, No. 7, Jul. 2000, pp. 628-637.
L. Carpenter, “The A-buffer, an Antialiased Hidden Surface Method”, Computer Graphics, vol. 18, No. 3, Jul. 1984, pp. 103-108.
Thomas Porter et al.,“Compositing Digital Images”, Computer Graphics, vol. 18, No. 3, Jul. 1984, pp. 253-259.
J. Foley et al., “Computer Graphics: Principles and Practice”; 2ndEdition, Addison-Wesley, 1997, pp. 81-87.
Scalable Vector Graphics (SVG)1.1 Specification, W3C Recommendation Jan. 14, 2003 (REC-SVG11-20030114), W3C® 0/ (MIT, ERCIM, Keio) http://www.w3. org/TR/2003/REC-SVG11-20030114/.
PostScript® Language Reference, 3rd ed., Adobe Systems Inc., Addison-Wesley Publishing Co., 1999, pp. 501-504.
Cormie Christopher James
Ecob Stephen Edward
Lawther Michael Jan
Fitzpatrick ,Cella, Harper & Scinto
Nguyen Hau H
Tung Kee M.
LandOfFree
Optimising compositing calculations for a run of pixels does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Optimising compositing calculations for a run of pixels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimising compositing calculations for a run of pixels will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3859216