Computer graphics processing and selective visual display system – Computer graphics processing – Graphic manipulation
Reexamination Certificate
1999-11-22
2004-04-13
Luu, Matthew (Department: 2672)
Computer graphics processing and selective visual display system
Computer graphics processing
Graphic manipulation
C345S592000, C345S635000
Reexamination Certificate
active
06720977
ABSTRACT:
BACKGROUND OF THE INVENTION
This invention relates to processing pieces of artwork in a computer-graphics illustration.
Many items in everyday life exhibit some degree of transparency. For example, a car windshield is almost completely transparent. The tinted glass of a bottle is less transparent than a car windshield; however, a viewer can still make out objects behind the bottle.
Simulating transparency in a computer-generated images can consume large amounts of computer memory due to the amount of data needed to describe the image. For example, an image printed by a typical computer printer is made up of millions of colored dots roughly 0.005 inches in size. For each dot, a computer must determine a color based on the different transparent graphics overlapping the area covered by the dot. The process of determining these colors is known as “compositing.”
SUMMARY OF THE INVENTION
In general, in one aspect, a method of processing a computer graphics illustration having overlapping pieces of artwork includes flattening the artwork into non-overlapping regions, storing information describing how the appearances of artwork can be combined to determine an appearance for the non-overlapping regions, determining an appearance for the non-overlapping regions based on the stored information, and outputting the determined appearance.
Embodiments may include one or more of the following. Outputting may include printing. Flattening the artwork into non-overlapping regions may include producing a planar map. The information describing how to combine appearances may include information describing how the appearances of two or more other non-overlapping regions can be combined to determine an appearance.
The method may further include discarding (e.g., deallocating from memory) the determined appearance of a non-overlapping region before determining an appearance of a different non-overlapping region. The method may further include not discarding selected regions.
Storing information may include constructing a directed graph that includes one or more nodes representing the appearance of one of the non-overlapping regions. Each node in the graph may be the root of a tree. Storing information may include constructing an artwork tree that stores transparency values for pieces of artwork. The artwork tree may store transparency values for groups of pieces of artwork.
Flattening artwork may include determining whether to include a piece of artwork or a portion of a piece of artwork in the flattening. Such determining may include determining whether a piece of artwork covers an area of the illustration also covered by one or more pieces of artwork having a degree of transparency. This determining may include mapping areas of the illustration covered by pieces of artwork having a degree of transparency and determining whether an opaque piece of artwork overlaps at least a portion of the mapped areas. Such mapping may include producing a map on an off-screen raster, for example, by using a rasterization engine to mark areas of the off-screen raster. The determining whether to include a piece of artwork in the flattening may include determining whether to include an opaque piece of artwork entirely within the mapped area. The determining may include a portion of an opaque piece of artwork within the mapped area. The outputting may include outputting an opaque piece of artwork outside the mapped area.
The determining whether to include a piece of artwork in the flattening may include mapping one or more complex regions of the illustration and determining whether a piece of artwork overlaps the mapped complex region(s). Mapping complex regions may include mapping areas having a number of paths of pieces of artwork that exceeds a threshold. Mapping a complex region may include stroking the paths of the pieces of artwork on an off-screen raster. The method may further include processing a piece of artwork based on its degree of overlap with a complex region. The method may further include rasterizing the complex region and outputting the rasterized area.
In general, in another aspect, the invention features a method of processing a computer graphics illustration having overlapping artwork objects. The method includes flattening the illustration artwork objects into non-overlapping regions of a planar map, and constructing a directed graph that includes a node for regions of the planar map. For at least some of the regions of the planar map, the method further includes determining a region appearance, outputting the determined appearance for the region, and discarding the stored appearance before determining the appearance of a different non-overlapping region.
In general, in another aspect, the invention features a computer program product, disposed on a computer readable medium, for processing a computer graphics illustration having overlapping pieces of artwork, each piece of artwork having an appearance. The computer program includes instructions for causing a processor to flatten at least some of the illustration artwork into non-overlapping regions, store information describing how the appearances of one or more pieces of artwork can be combined to determine an appearance for a given one of the non-overlapping regions, determine an appearance for at least one of the non-overlapping regions based on the stored information, and output the determined appearance.
REFERENCES:
patent: 4769636 (1988-09-01), Iwami et al.
patent: 5337404 (1994-08-01), Baudelaire et al.
patent: 5390291 (1995-02-01), Ohashi
patent: 5509110 (1996-04-01), Latham
patent: 5680526 (1997-10-01), Andresen et al.
patent: 5687304 (1997-11-01), Kiss
patent: 5745121 (1998-04-01), Politis
patent: 5818975 (1998-10-01), Goodwin et al.
patent: 5889527 (1999-03-01), Tsai
patent: 5912672 (1999-06-01), Liguori
patent: 5912674 (1999-06-01), Magarshak
patent: 5923333 (1999-07-01), Stroyan
patent: 5926185 (1999-07-01), Vyncke et al.
patent: 5936634 (1999-08-01), Kawamoto et al.
patent: 5977979 (1999-11-01), Clough et al.
patent: 6031544 (2000-02-01), Yhann
patent: 6043824 (2000-03-01), Bier
patent: 6049339 (2000-04-01), Schiller et al.
patent: 6072501 (2000-06-01), Bier
patent: 6356274 (2002-03-01), Spector
patent: 6359635 (2002-03-01), Perttunen
patent: 6437796 (2002-08-01), Sowizral et al.
patent: 0528631 (1993-02-01), None
patent: 0712089 (1996-05-01), None
patent: 0924653 (1999-06-01), None
Baudelaire, et al. “Planar Maps: An Interaction Paradigm for Graphic Design”,SIGCHI Bulletin, New York, NY, USA, pp. 313-318, May, 1989.
Heckbert (ed.), Graphics Gems IV, 1994, AP Professional, Academic Press, Inc., Cambridge, MA, pp. 29-30.
Bourdev Lubomir D.
Newell Martin E.
Schiller Stephen N.
Adobe Systems Incorporated
Chung Daniel J
Fish & Richardson P.C.
Luu Matthew
LandOfFree
Processing illustration artwork does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Processing illustration artwork, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Processing illustration artwork will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3274414