| Patent application number | Description | Published |
|---|
| 20090189898 | SHALLOW BOUNDING VOLUME HIERARCHIES FOR ACCELERATED RAY TRACING - Methods, systems, devices, and computer program code (software) products enable acceleration of ray tracing by using acceleration data structures with high arity to enable processing of nodes using streaming SIMD (Single Instruction, Multiple Data) instructions with reduced memory requirements. | 07-30-2009 |
| 20090213115 | INSTANT RAY TRACING - Methods, systems, devices and computer program products operable in a computer graphics system include constructing a hierarchical ray tracing acceleration data structure comprising a tree structure, the nodes of which are generated utilizing a bounding interval hierarchy based on defining an axis-aligned scene bounding box and two parallel planes to partition a set of objects in a scene into left objects and right objects, and matching split planes to object bounding boxes. The two planes are perpendicular to a selected one of x, y, or z-axes. Given a splitting plane, each object in an image is classified either left or right based on a left/right selection criterion, and two splitting plane values of the child nodes are determined by the maximum and minimum coordinate of the left and right objects, respectively. | 08-27-2009 |
| 20090256845 | ACCELERATED RAY TRACING - Methods, systems and computer program code (software) products executable in a computer processor element include computing, in the processor element, a minimal axis-aligned bounding box of the intersection of a given axis-aligned bounding box and a triangle under linear motion, and/or traversing, in the processor element, a ray tracing acceleration hierarchy for a given set of rays, wherein the traversing includes computing decisions for a representative form of the rays, without requiring a traversing of all rays in turn. | 10-15-2009 |
| 20100281480 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR DECOMPOSING A SAMPLING TASK INTO A PLURALITY OF JOBS - A system, method, and computer program product are provided for decomposing a sampling task into a plurality of jobs. In operation, a sampling task is identified. Additionally, the sampling task is decomposed into a plurality of jobs. Further, each of the plurality of jobs are processed in parallel. Still yet, each of the plurality of jobs are allowed to terminate independently of the other plurality of jobs. | 11-04-2010 |
| 20100289799 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR EFFICIENT RAY TRACING OF MICROPOLYGON GEOMETRY - A system, method, and computer program product are provided for efficiently ray tracing micropolygon or other highly complex geometry. In operation, a first hierarchy of a plurality of objects is established. Additionally, rays are traced using the first hierarchy to efficiently identify which of the plurality of objects are potentially intersected. Furthermore, at least one of the potentially intersected objects are decomposed, on-demand, into a set of subobjects, each set of subobjects corresponding to one of the at least one of the potentially intersected objects. Still yet, a second hierarchy is established for at least one of the set of subobjects, the second hierarchy being determined by a connectivity of subobjects in an associated set of subobjects in order to accelerate ray tracing. | 11-18-2010 |
| 20110025682 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR CONSISTENT IMAGE SYNTHESIS - A system, method, and computer program product are provided for focusing computing power to a region of interest that can be changed interactively and arbitrarily during the process of image synthesis. In operation, a problem domain is partitioned utilizing a first selected technique. Additionally, a number of samples to be drawn per partition are assigned utilizing a second selected technique. Furthermore, the assigned number of samples are drawn for each partition, where the samples are generated by only one deterministic sample sequence. Still yet, the partitioning, assigning, and drawing are capable of being repeated such that existing partitions and assignments are capable of remaining unchanged during sampling and a convergence speed is adapted without compromising convergence in at least one of a sequential computing environment or a parallel computing environment. In this way, the convergence of image synthesis is not compromised. In fact, the image synthesis process may converge to the same solution that would have been obtained without interaction. | 02-03-2011 |
