Canon Kabushiki Kaisha

Hervé Soulard

Jun Liu

Andrew R Coker

David Karlov

Abhijit Mandal

Ari Pekka Lampinen

Alexander Zaphob Barnes

A method of tessellating a parametric patch () of an object is disclosed. A boundary curve associated with the parametric patch () is vectorized according to a pre-determined flatness tolerance. A tessellation point associated with a first parametric value inside the parametric patch () is determined based on geometry of the parametric patch () and a tessellation step. A curve associated with the first parametric value is determined based on the geometry of the parametric patch () and the tessellation step. A color split point on the vectorized boundary curve is determined. The color split point is determined based on the vectorized boundary curve and the determined curve associated with the first parametric value. The parametric patch () is tessellated by joining the color split point and the tessellation point.

Method, apparatus and system for tessellating a parametric patch

A method of rendering a parametric patch. The patch is defined by a geometry and a color varying according to a surface mapping points of the patch to intermediate values. Each of the intermediate values is mapped to a color value according to a shading color function. A set of intermediate values is determined for the patch. The determined set of intermediate values represent an approximation of the shading color function by linear segments. The patch is tessellated into a plurality of cells. Tessellation points are determined for each of the plurality of cells according to the determined set of intermediate values. A further cell is formed for the patch by joining, within each of said plurality of cells, a plurality of the tessellation points being of equal intermediate value and approximating isolines of the surface. The patch is rendered using the intermediate values.

Method, system and apparatus for rendering

Disclosed is a computer-implemented method of vectorizing a curve. The method determines a reference point distanced from the curve and a first point on the curve associated with the reference point, and a line running through the reference point from a tangent to the curve at the first point, where the line and tangent are parallel. A shift point is then determined on the determined line, and the curve is vectorized by a path formed from a plurality of linear segments, the plurality of segments comprising at least a segment joining the reference point and the shift point. From the vectorization of the curve the curve can be rendered, particularly using dashed strokes.

Alignment of start and end of dashed curves

A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.

Skip list generation

A method of vectoring a curve having an endpoint and a tangent associated with the curve at the endpoint. The method determines a first point on the curve following the endpoint where a perpendicular distance between a first linear segment, joining the first point and the endpoint, and the curve, does not exceed a tolerance. A second point on the tangent is then determined for which a perpendicular distance from the first segment to the second point does not exceed the tolerance. The curve is then vectorized by a path formed of a plurality of linear segments, the plurality of linear segments comprising at least a second segment joining the endpoint and the second point, and a third segment joining the second point to the first point.

Growing community of inventors

Beacon Hill, Australia

Hervé Soulard