Patents by Inventor Jacopo Pantaleoni
Jacopo Pantaleoni 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: 9305392Abstract: Techniques are disclosed for tracing a ray within a parallel processing unit. A first thread receives a ray or a ray segment for tracing and identifies a first node within an acceleration structure associated with the ray, where the first node is associated with a volume of space traversed by the ray. The thread identifies the child nodes of the first node, where each child node is associated with a different sub-volume of space, and each sub-volume is associated with a corresponding ray segment. The thread determines that two or more nodes are associated with sub-volumes of space that intersect the ray segment. The thread selects one of these nodes for processing by the first thread and another for processing by a second thread. One advantage of the disclosed technique is that the threads in a thread group perform ray tracing more efficiently in that idle time is reduced.Type: GrantFiled: December 13, 2012Date of Patent: April 5, 2016Assignee: NVIDIA CorporationInventors: David Luebke, Timo Aila, Jacopo Pantaleoni, David Tarjan
-
Patent number: 9305324Abstract: A system, method, and computer program product are provided for tiled deferred shading. In operation, a plurality of photons associated with at least one scene are identified. Further, a plurality of screen-space tiles associated with the at least one scene are identified. Additionally, each of the plurality of screen-space tiles capable of being affected by a projection of an effect sphere for each of the plurality of photons are identified. Furthermore, at least a subset of photons associated with each of the screen-space tiles from which to compute shading are selected. Moreover, shading for the at least one scene is computed utilizing the selected at least a subset of photons.Type: GrantFiled: August 30, 2013Date of Patent: April 5, 2016Assignee: NVIDIA CorporationInventors: Morgan McGuire, Michael Thomas Mara, David Patrick Luebke, Jacopo Pantaleoni
-
Patent number: 8943091Abstract: A system, method, and computer program product are provided for performing a string search. In use, a first string and a second string are identified. Additionally, a string search is performed, utilizing the first string and the second string.Type: GrantFiled: November 1, 2012Date of Patent: January 27, 2015Assignee: NVIDIA CorporationInventors: Jacopo Pantaleoni, David Tarjan
-
Publication number: 20150006090Abstract: A sequencing application implements a multi-stage search technique in order to identify locations where a sequence of elements occurs within a much longer reference sequence of elements. The sequencing application breaks the sequence of elements into multiple, possibly overlapping seeds, used to determine all potential occurrences of the sequence in the reference. In order to determine the occurrences of each of the seeds in the reference, the application breaks the seeds into multiple sub-seeds and implements a different search stage for each different short sub-seeds. If a given search stage produces a small number of search results, then the sequencing application determines that each of the occurrences can be tested for a complete match between the entire short read and the reference string, for example using a Smith-Waterman or Needleman-Wunsch algorithm. Otherwise the application attempts to further restrict the determined number of potential occurrences proceeding to the next search stage.Type: ApplicationFiled: June 26, 2013Publication date: January 1, 2015Inventor: Jacopo PANTALEONI
-
Publication number: 20140176575Abstract: A system, method, and computer program product are provided for tiled deferred shading. In operation, a plurality of photons associated with at least one scene are identified. Further, a plurality of screen-space tiles associated with the at least one scene are identified. Additionally, each of the plurality of screen-space tiles capable of being affected by a projection of an effect sphere for each of the plurality of photons are identified. Furthermore, at least a subset of photons associated with each of the screen-space tiles from which to compute shading are selected. Moreover, shading for the at least one scene is computed utilizing the selected at least a subset of photons.Type: ApplicationFiled: August 30, 2013Publication date: June 26, 2014Applicant: NVIDIA CorporationInventors: Morgan McGuire, Michael Thomas Mara, David Patrick Luebke, Jacopo Pantaleoni
-
Publication number: 20140173606Abstract: A technique for executing alignment algorithms on a SIMT processing environment is disclosed. An alignment algorithm having multiple stages is executed within the SIMT environment such that a different thread group executes each stage of the algorithm. Each thread group performs a different set of alignment operations related to a different stage of alignment algorithm for a group of short reads. In such a manner, the thread groups operate in unison to perform all the operations related to each stage of the alignment algorithm on every short read in the group of short reads.Type: ApplicationFiled: December 19, 2012Publication date: June 19, 2014Applicant: NVIDIA CorporationInventor: Jacopo PANTALEONI
-
Publication number: 20140168238Abstract: Techniques are disclosed for tracing a ray within a parallel processing unit. A first thread receives a ray or a ray segment for tracing and identifies a first node within an acceleration structure associated with the ray, where the first node is associated with a volume of space traversed by the ray. The thread identifies the child nodes of the first node, where each child node is associated with a different sub-volume of space, and each sub-volume is associated with a corresponding ray segment. The thread determines that two or more nodes are associated with sub-volumes of space that intersect the ray segment. The thread selects one of these nodes for processing by the first thread and another for processing by a second thread. One advantage of the disclosed technique is that the threads in a thread group perform ray tracing more efficiently in that idle time is reduced.Type: ApplicationFiled: December 13, 2012Publication date: June 19, 2014Applicant: NVIDIA CorporationInventors: David LUEBKE, Timo AILA, Jacopo PANTALEONI, David TARJAN
-
Publication number: 20140168228Abstract: Techniques are disclosed for tracing a ray within a parallel processing unit. A first thread receives a ray or a ray segment for tracing and identifies a first node within an acceleration structure associated with the ray, where the first node is associated with a volume of space traversed by the ray. The thread identifies the child nodes of the first node, where each child node is associated with a different sub-volume of space, and each sub-volume is associated with a corresponding ray segment. The thread determines that two or more nodes are associated with sub-volumes of space that intersect the ray segment. The thread selects one of these nodes for processing by the first thread and another for processing by a second thread. One advantage of the disclosed technique is that the threads in a thread group perform ray tracing more efficiently in that idle time is reduced.Type: ApplicationFiled: December 13, 2012Publication date: June 19, 2014Applicant: NVIDIA CorporationInventors: David LUEBKE, Timo AILA, Jacopo PANTALEONI, David TARJAN
-
Publication number: 20140123147Abstract: A system, method, and computer program product are provided for reconstructing a sampled suffix array. The sampled suffix array is reconstructed by, for each index of a sampled suffix array for a string, calculating a block value corresponding to the index based on an FM-index, and reconstructing the sampled suffix array corresponding to the string based on the block values. Calculating at least two block values for at least two corresponding indices of the sampled suffix array is performed in parallel.Type: ApplicationFiled: November 1, 2012Publication date: May 1, 2014Applicant: NVIDIA CORPORATIONInventor: Jacopo Pantaleoni
-
Publication number: 20140122509Abstract: A system, method, and computer program product are provided for performing a string search. In use, a first string and a second string are identified. Additionally, a string search is performed, utilizing the first string and the second string.Type: ApplicationFiled: November 1, 2012Publication date: May 1, 2014Applicant: NVIDIA CORPORATIONInventors: Jacopo Pantaleoni, David Tarjan
-
Patent number: 8576227Abstract: Systems and methods for estimating light transport between respective points includes selecting a plurality of first sub-paths extending the first point A. and selecting a plurality of second sub-paths extending from a second point B. A plurality of transport paths are constructed, wherein each one of the plurality of the first sub-paths is coupled to a respective one of the plurality of second paths, and wherein each transport path comprises one first sub-path and one second sub-path. Two or more of the transport paths are sampled, and a light transport value for each of the sampled transport paths is calculated to estimate the light transported between first point A and second point B.Type: GrantFiled: August 28, 2012Date of Patent: November 5, 2013Assignee: NVIDIA CorporationInventor: Jacopo Pantaleoni
-
Patent number: 8538204Abstract: A method for estimating pixel intensity includes generating a plurality of bidirectional paths extending between a light source and a measurement point, whereby the measurement point represents a pixel within the image. Each bidirectional path includes a light subpath portion extending from the light source and an eye subpath portion extending from the view point and coupled to the light subpath. Each light subpath is characterized by a number of vertices included therein, and similarly, each eye subpath is characterized by a number of vertices included therein. The plurality of bidirectional paths are sorted into separation populations, whereby each population includes bidirectional paths constructed from eye subpaths having a common number of vertices, and light subpaths having a common number of vertices. An intensity contribution is computed for each of the individual populations, and the intensity contributions are summed over all populations to estimate the intensity of the pixel.Type: GrantFiled: September 7, 2011Date of Patent: September 17, 2013Assignee: NVIDIA CorporationInventor: Jacopo Pantaleoni
-
Publication number: 20130033507Abstract: A system, method, and computer program product are provided for constructing an acceleration structure. In use, a plurality of primitives associated with a scene is identified. Additionally, an acceleration structure is constructed, utilizing the primitives.Type: ApplicationFiled: August 4, 2011Publication date: February 7, 2013Applicant: NVIDIA CorporationInventors: Kirill Vladimirovich Garanzha, Jacopo Pantaleoni, David Kirk McAllister
-
Patent number: 8279220Abstract: Systems and methods for estimating light transport between respective points includes selecting a plurality of first sub-paths extending the first point A, and selecting a plurality of second sub-paths extending from a second point B. A plurality of transport paths are constructed, wherein each one of the plurality of the first sub-paths is coupled to a respective one of the plurality of second paths, and wherein each transport path comprises one first sub-path and one second sub-path. Two or more of the transport paths are sampled, and a light transport value for each of the sampled transport paths is calculated to estimate the light transported between first point A and second point B.Type: GrantFiled: June 1, 2009Date of Patent: October 2, 2012Assignee: NVIDIA CorporationInventor: Jacopo Pantaleoni
-
Patent number: 8102394Abstract: Computer graphics methods, systems, apparatus and computer program code (software) products comprise: constructing a sparse implicit scene representation, wherein the representation is independent of geometric encoding and complexity of the input scene description, and the density of the resulting finite elements is proportional to their contribution to the final image to be generated, such that the geometric resolution of a given area of the obtained scene representation is proportional to its importance relative to the final image, wherein the constructing comprises using a Monte Carlo or quasi-Monte Carlo path tracing method to sample an adjoint importance distribution function and to shoot importons from a simulated camera into the scene, recording, for each simulated bounce, a particle i defined by selected information, the selected information comprising: 3D position pi, surface normal ni, and reflectance factor pi.Type: GrantFiled: December 13, 2007Date of Patent: January 24, 2012Assignee: Mental Images GmbHInventor: Jacopo Pantaleoni
-
Publication number: 20080150938Abstract: Computer graphics methods, systems, apparatus and computer program code (software) products comprise: constructing a sparse implicit scene representation, wherein the representation is independent of geometric encoding and complexity of the input scene description, and the density of the resulting finite elements is proportional to their contribution to the final image to be generated, such that the geometric resolution of a given area of the obtained scene representation is proportional to its importance relative to the final image, wherein the constructing comprises using a Monte Carlo or quasi-Monte Carlo path tracing method to sample an adjoint importance distribution function and to shoot importons from a simulated camera into the scene, recording, for each simulated bounce, a particle i defined by selected information, the selected information comprising: 3D position pi, surface normal ni, and reflectance factor pi.Type: ApplicationFiled: December 13, 2007Publication date: June 26, 2008Applicant: MENTAL IMAGES GMBHInventor: Jacopo Pantaleoni