Patents by Inventor Hervé Soulard
Hervé Soulard has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9754409Abstract: A method of tessellating a parametric patch (610) of an object is disclosed. A boundary curve associated with the parametric patch (610) is vectorized according to a pre-determined flatness tolerance. A tessellation point associated with a first parametric value inside the parametric patch (610) is determined based on geometry of the parametric patch (610) and a tessellation step. A curve associated with the first parametric value is determined based on the geometry of the parametric patch (610) 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 (610) is tessellated by joining the color split point and the tessellation point.Type: GrantFiled: December 3, 2014Date of Patent: September 5, 2017Assignee: CANON KABUSHIKI KAISHAInventors: Hervé Soulard, Jun Liu, Andrew R Coker, Abhijit Mandal
-
Publication number: 20170124726Abstract: Systems and methods for determining a wall thickness of an object defined by a surface mesh model receiving an initial polygon and a neighbouring polygon of the surface mesh model sharing at least one vertex with the initial polygon. Each received polygon is associated with a search volume extending inside the object substantially perpendicular to a surface of the corresponding polygon. The method determines, based on normals to the surfaces of the initial polygon and the neighbouring polygon, a region inside the object, the determined region being between the search volumes of the initial polygon and the neighbouring polygon. The method expands the search volume associated with the initial polygon towards the determined region to form an expanded search volume, and then determines the wall thickness of the initial polygon using a distance from the initial polygon to a further polygon within the expanded search volume.Type: ApplicationFiled: November 2, 2015Publication date: May 4, 2017Inventors: HERVE SOULARD, David Karlov
-
Patent number: 9508316Abstract: 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.Type: GrantFiled: June 26, 2014Date of Patent: November 29, 2016Assignee: Canon Kabushiki KaishaInventors: Jun Liu, Hervé Soulard, Andrew R Coker
-
Patent number: 9317944Abstract: 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.Type: GrantFiled: August 26, 2014Date of Patent: April 19, 2016Assignee: CANON KABUSHIKI KAISHAInventors: Ari Pekka Lampinen, Hervé Soulard
-
Publication number: 20150154797Abstract: A method of tessellating a parametric patch (610) of an object is disclosed. A boundary curve associated with the parametric patch (610) is vectorised according to a pre-determined flatness tolerance. A tessellation point associated with a first parametric value inside the parametric patch (610) is determined based on geometry of the parametric patch (610) and a tessellation step. A curve associated with the first parametric value is determined based on the geometry of the parametric patch (610) and the tessellation step. A colour split point on the vectorised boundary curve is determined. The colour split point is determined based on the vectorised boundary curve and the determined curve associated with the first parametric value. The parametric patch (610) is tessellated by joining the colour split point and the tessellation point.Type: ApplicationFiled: December 3, 2014Publication date: June 4, 2015Inventors: Hervé SOULARD, Jun Liu, Andrew R. Coker, Abhijit Mandal
-
Publication number: 20150063706Abstract: 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.Type: ApplicationFiled: August 26, 2014Publication date: March 5, 2015Inventors: Ari Pekka LAMPINEN, Hervé Soulard
-
Patent number: 8959309Abstract: 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.Type: GrantFiled: November 4, 2011Date of Patent: February 17, 2015Assignee: Canon Kabushiki KaishaInventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov
-
Publication number: 20150002529Abstract: A method of rendering a parametric patch is disclosed. The parametric patch is received. 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 corresponding to vertices of the further cell.Type: ApplicationFiled: June 26, 2014Publication date: January 1, 2015Inventors: Jun LIU, Hervé Soulard, Andrew R. Coker
-
Patent number: 8659786Abstract: 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.Type: GrantFiled: April 18, 2012Date of Patent: February 25, 2014Assignee: Canon Kabushiki KaishaInventor: Hervé Soulard
-
Publication number: 20120268794Abstract: 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.Type: ApplicationFiled: April 18, 2012Publication date: October 25, 2012Applicant: CANON KABUSHIKI KAISHAInventor: Hervé Soulard
-
Publication number: 20120136871Abstract: 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.Type: ApplicationFiled: November 4, 2011Publication date: May 31, 2012Applicant: CANON KABUSHIKI KAISHAInventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov
-
Publication number: 20120011166Abstract: 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.Type: ApplicationFiled: September 23, 2011Publication date: January 12, 2012Applicant: CANON KABUSHIKI KAISHAInventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov
-
Publication number: 20100325083Abstract: 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.Type: ApplicationFiled: June 7, 2010Publication date: December 23, 2010Applicant: CANON KABUSHIKI KAISHAInventors: Hervé Soulard, Alexander Zaphob Barnes, David Karlov