Complexity-based transparency flattening

Details Complexity-based transparency flattening Complexity-based transparency flattening

2007-04-24

2007-04-24

Popovici, Dov (Department: 2625)

Facsimile and static presentation processing

Static presentation processing

Detail of image placement or content

C358S001160

Reexamination Certificate

active

10153426

ABSTRACT:
Methods and apparatus, including computer program products, implementing and using techniques for rendering an electronic document page that includes one or more objects. It is determined whether any object of the one or more objects on the document page is a transparent object. If a transparent object is found, the document page is divided into a plurality of subregions. For each subregion, a set of one or more opaque object components is generated for any object having a location in the subregion. The document page is rendered, including separately rendering each of the plurality of subregions.

REFERENCES:
patent: 5555352 (1996-09-01), Lucas
patent: 5745121 (1998-04-01), Politis
patent: 5912672 (1999-06-01), Liguori
patent: 5923333 (1999-07-01), Stroyan
patent: 5990904 (1999-11-01), Griffin
patent: 6020897 (2000-02-01), Carlsen et al.
patent: 6049339 (2000-04-01), Schiller et al.
patent: 6720977 (2004-04-01), Bourdev et al.
patent: 2002/0130888 (2002-09-01), Perry et al.
patent: 1 104 918 (2001-06-01), None
J. Nievergelt & F.P. Preparata, “Plane-Sweep Algorithms for Intersecting Geometric Figures”, Oct. 1982, pp. 739-747.

Affiliated with

Also associated with

Rating

Complexity-based transparency flattening does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Complexity-based transparency flattening, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity-based transparency flattening will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3746332