Adobe, Inc.

Stephan R Yhann

Prasun Choudhury

Alexandre S Parenteau

Dejan Markovic

Richard A Dermer

Douglas Richard Becker

Dennis Mercer

Robert Stevenson

A method, system, and computer-readable storage medium are disclosed for rendering B&#xe9;zier curves using a graphics processing unit (GPU). In one embodiment, a plurality of quadratic B&#xe9;zier curves approximating a cubic B&#xe9;zier curve are automatically generated. In one embodiment, the plurality of quadratic B&#xe9;zier curves are rendered using the GPU.

Rendering cubic B&#xe9;zier curves as quadratic curves using a GPU

A method, system, and computer-readable storage medium are disclosed for dynamic tessellation spreading. In one embodiment, an offset vector may be determined for each of a plurality of vertices, wherein the plurality of vertices define an original path. The plurality of vertices and the plurality of offset vectors may be sent to a graphics processing unit (GPU). A spread path may be generated in the GPU, wherein generating the spread path comprises adjusting each vertex by the respective offset vector in a coordinate space of a target device. The spread path may be rendered to the target device using the GPU.

Dynamic tessellation spreading for resolution-independent GPU anti-aliasing and rendering

A method, system, and computer-readable storage medium are disclosed for rendering a path with classification of triangles as external and internal. In one embodiment, a tessellation based on the path may be generated, wherein the tessellation comprises a plurality of triangles. A first subset of the plurality of triangles may be determined to comprise one or more exterior triangles, wherein each of the one or more exterior triangles contains a respective curve. For each triangle of the one or more exterior triangles, a side of the curve to be rendered may be determined. A second subset of the plurality of triangles may be determined to comprise one or more interior triangles. The exterior triangles and the interior triangles may be rendered using a graphics processing unit, wherein each of the exterior triangles is rendered based on the respective side of the curve determined to be rendered.

Classification of exterior and interior triangles for artwork rendering

A method, system, and computer-readable storage medium are disclosed for rendering B&#xe9;zier curves using a graphics processing unit (GPU). In one embodiment, a triangle representing a quadratic B&#xe9;zier curve is sent to the GPU, wherein the triangle comprises only one texture coordinate per vertex, and wherein each texture coordinate comprises a first coordinate of the respective vertex in a canonical space. In one embodiment, a second coordinate in the canonical space for each vertex sent to the GPU may be determined based on the first coordinate in the canonical space for the respective vertex. In one embodiment, the quadratic B&#xe9;zier curve is rendered using the GPU.

Efficient data packaging for rendering b&#xe9;zier curves on a GPU

A method, system, and computer-readable storage medium are disclosed for rendering B&#xe9;zier curves using a graphics processing unit (GPU). In one embodiment, a respective set of barycentric coordinates may be assigned to each of the three vertices of a triangle. The triangle may comprise a control triangle for a quadratic B&#xe9;zier curve, and the quadratic B&#xe9;zier curve may be a rational quadratic B&#xe9;zier curve. Each set of barycentric coordinates may comprise three values such as (1,0,0), (0,1,0) or (0,0,1). In one embodiment, the quadratic B&#xe9;zier curve may be rendered using the GPU. Rendering the quadratic B&#xe9;zier curve may comprise evaluating a function of the barycentric coordinates using the GPU.

Rendering rational quadratic B&#xe9;zier curves on a GPU

Methods, program products and systems for automatically trapping drop shadows. For at least one segment incident to an atomic region which includes a drop shadow, and for each side of the segment, determining a first flattened color of the side's incident atomic region, and if the atomic region includes a drop shadow, additionally determining a second flattened color omitting the color of the drop shadow. An effective neutral density from the side's first flattened color is determined and, if the side has a second flattened color, the side's second flattened color. The two atomic regions incident to the segment are trapped based upon the effective neutral densities for the respective sides.

Automatic trapping of drop shadows

Computer-implemented methods and apparatus for processing a graphical element that has an associated original type, including blending at least part of the graphical element and at least part of one or more other graphical elements to produce a transformed graphical element. The transformed graphical element has an associated transformed type, and the transformed type is different than the original type. Information about the original type is stored, and the transformed graphical element, an adjacent graphical element, or both are processed using the stored information about the original type.

Processing illustrations using stored information

Methods and apparatus implementing techniques for identifying, in a device space, an effective centerscan object color along an edge between an overscan object and a centerscan object, the overscan object having a higher paint order than the centerscan object. The edge is mapped to the device space. A set of overscan boundary pixels is identified in the device space, the overscan boundary pixels being device space pixels that are intersected by the edge. A vector pointing in a direction of the centerscan object relative to the edge is created. The vector is applied to each overscan boundary pixel in the set of overscan boundary pixels to identify a corresponding set of centerscan boundary pixels in the device space. Each centerscan boundary pixel is mapped to the centerscan object to identify a color of the centerscan boundary pixel. A corresponding method for reversed paint order is also described.

Image edge color computation

Methods, and apparatus, including computer programs, implement techniques for generating a polygon from a bitmap object. Boundary pixels of the bitmap object are identified. A boundary pixel is an object pixel that shares an edge with a non-object pixel or a non-object pixel that shares an edge with an object pixel. All perimeter edge line segments are identified for each identified boundary pixel. A perimeter edge line segment is an edge line segment that separates an object pixel from a non-object pixel. The identified perimeter edge line segments are accumulated to define a polygon.

Converting bitmap objects to polygons

Methods, and apparatus implementing the methods, that provide useful resolution-independent representations of the perimeter of a bitmap object. The methods find the boundary pixels in a bitmap and identify each boundary pixel edge that actually contributes to the object perimeter. The methods distinguish objects that appear to share a common edge because they share boundary pixels, when in fact the objects are separated by a pixel width. The polygon can be encoded in a digital, compact, compressible format, and can be used to define traps in a vector-based trapping environment. A finite state machine for generating the polygon is disclosed. A bitmap object is encode by calculating a sequence of direction codes based on tracing around the bitmap object along the boundary, where each direction code represents a direction from an eight-connected pixel to an adjacent eight-connected pixel. In another aspect, the invention provides a technique for trapping mixed bitmap and vector objects in a vector-based trapping process. The bitmap objects on a page are converted to perimeter polygons, the polygons are planarized with the vector objects of the page, and the resulting planar structures are trapped.

A method of trapping objects for a page includes identifying sequential matching objects, combining into a larger object matching sequential objects including parameterizing each object as a band in the larger object and trapping non-matching objects and the larger object. In another aspect, a method of preparing a page to be printed is provided that includes receiving a page description language file describing the page to be printed, identifying sequential matching objects in the page description file that represent a gradient to be printed on the page and combining into a larger object matching sequential objects. The step of combining includes defining an outline for the object and a defining a function describing the coloring for the object.

Vignette recognition and compression

A vector map representation of page information to perform trapping. The vector map representation combines the positive attributes of both raster and vector based representations to make trapping more efficient by combining the sparseness of the vector representation and the constant unit complexity of the raster representation. In the preferred embodiment of the invention, a page is defined by tiles, and each tile is mapped to a 2-D array of edge pointers referred to as the vector map. Each cell in the vector map contains a list of all of the edges of the image that pass through it. A pair of edges can only interact if they are in the same vector map cell list. Thus, edge intersection and color finding tests are localized as with raster based trapping while the data sparseness of vector based trapping is retained. For a suitably chosen vector map size, a single edge generally does not intersect many cells. A trapping function is applied to edges as determined from the vector map.

Growing community of inventors

Renton, WA, United States of America

Stephan R Yhann