Patent application number | Description | Published |
20130321420 | RAY-NODE TEST USING INTEGER COMPARISONS - A method including performing ray traversal wherein the ray traversal includes determining boxes intersected by a ray. The ray traversal includes performing a ray-box intersection test including calculating plane intersections, and determining comparisons of two operands wherein each operand is a binary representation of a floating point value and wherein further the determining comparisons operation is performed using an integer unit of the computer graphics system. The ray-box intersection test further includes, responsive to results of the comparisons, calculating span intersections of the boxes. | 12-05-2013 |
20140006754 | SYSTEM AND METHOD FOR PERFORMING PREDICATED SELECTION OF AN OUTPUT REGISTER | 01-02-2014 |
20140022237 | SURFACE CLASSIFICATION FOR POINT-BASED RENDERING WITHIN GRAPHICS DISPLAY SYSTEM - A method including casting a ray from a point toward a point-based three dimensional scene. The scene includes memory resident objects with object surfaces and a first splat and a second splat associated with the object surfaces. The first splat and the second splat have a position and a normal vector. The method also includes forming an event line through the first splat and the second splat. The event line intersects the first splat and the second splat. The method further includes determining whether a visibility conflict exists between the first splat and the second splat. The method also includes separating the first splat and the second splat to different object surfaces if the visibility conflict exists, otherwise merging the first splat and the second splat to a single object surface. | 01-23-2014 |
20140022251 | LIGHT TRANSPORT CONSISTENT SCENE SIMPLIFICATION WITHIN GRAPHICS DISPLAY SYSTEM - Method including casting a first plurality of rays towards an original 3-D scene comprising objects with object surfaces. Method also includes constructing a simplified representation of the original 3-D scene and adjusting the simplified representation to be consistent with the original 3-D scene. Simplified representation is adjusted by using known rays and object surface intersections obtained from the casting, to produce an adjusted simplified representation. Method further includes steps for rendering a high quality image: casting a second plurality of rays toward the adjusted simplified representation and testing the second plurality of rays for points of intersection with the object surfaces within the adjusted simplified representation, estimating incoming light within the adjusted simplified representation at the points of intersection with the object surfaces, examining material properties of the object surfaces, and calculating a color and light intensity for a plurality of pixels associated with the second plurality of rays. | 01-23-2014 |
20140258693 | SYSTEM AND METHOD FOR HARDWARE SCHEDULING OF CONDITIONAL BARRIERS AND IMPATIENT BARRIERS - A method and a system are provided for hardware scheduling of barrier instructions. Execution of a plurality of threads to process instructions of a program that includes a barrier instruction is initiated, and when each thread reaches the barrier instruction during execution of program, it is determined whether the thread participates in the barrier instruction. The threads that participate in the barrier instruction are then serially executed to process one or more instructions of the program that follow the barrier instruction. A method and system are also provided for impatient scheduling of barrier instructions. When a portion of the threads that is greater than a minimum number of threads and less than all of the threads in the plurality of threads reaches the barrier instruction each of the threads in the portion is serially executed to process one or more instructions of the program that follow the barrier instruction. | 09-11-2014 |
20140267238 | CONSERVATIVE RASTERIZATION OF PRIMITIVES USING AN ERROR TERM - A system, method, and computer program product are provided for conservative rasterization of primitives using an error term. In use, an edge equation is determined for each edge of a primitive, the edge equation having coefficients defining the edge of the primitive. Each edge of the primitive is shifted to enlarge the primitive by modifying coefficients of the edge equation defining the edge by an error term that is a predetermined amount. Pixels that intersect the primitive are then determined using the enlarged primitive. | 09-18-2014 |
20140340403 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR UTILIZING A WAVEFRONT PATH TRACER - A system, method, and computer program product are provided for utilizing a wavefront path tracer. In use, a set of light transport paths associated with a scene is identified. Additionally, parallel path tracing is performed, utilizing a wavefront path tracer. | 11-20-2014 |
20140362074 | SPLITTING BOUNDING VOLUMES OF PRIMITIVES - A system, method, and computer program product are provided for splitting primitives. A plurality of primitives is received for a scene and a pre-determined plane that intersects the scene is identified. Bounding volumes of the plurality of primitives that are intersected by the pre-determined plane are split, where a bounding volume that encloses each intersected primitive of the plurality of primitives is split into a first bounding volume and a second bounding volume at an intersection of the bounding volume and the pre-determined plane. | 12-11-2014 |
20140365529 | AGGLOMERATIVE TREELET RESTRUCTURING FOR BOUNDING VOLUME HIERARCHIES - A system, method, and computer program product are provided for modifying a hierarchical tree data structure. An initial hierarchical tree data structure is received, and treelets of node neighborhoods are formed. A processor restructures the treelets using agglomerative clustering to produce an optimized hierarchical tree data structure that includes at least one restructured treelet, where each restructured treelet includes at least one internal node. | 12-11-2014 |
20140365532 | BOUNDING VOLUME HIERARCHIES THROUGH TREELET RESTRUCTURING - A system, method, and computer program product are provided for modifying a hierarchical tree data structure. An initial hierarchical tree data structure is received and treelets of node neighborhoods in the initial hierarchical tree data structure are formed. Each treelet includes n leaf nodes and n−1 internal nodes. The treelets are restructured, by a processor, to produce an optimized hierarchical tree data structure. | 12-11-2014 |