Patent application number | Description | Published |
20100050859 | CLAMPING SLEEVE - A clamping sleeve is of generally cylindrical shape with a hollow interior and comprises an upper crown, a lower crown, and a tubular sidewall. The upper crown is positioned at an upper end of the clamping sleeve. The lower crown is positioned at a lower end of the clamping sleeve. The tubular sidewall is positioned between the upper and lower crown and includes one or more corrugations that utilize spring like principles such that pressure applied to the external surface of the tubular sidewall circumferentially flexes the clamping sleeve in order to reduce the diameter of the clamping sleeve and apply a clamping force to an object within the clamping sleeve. The clamping sleeve may be utilized in a work support that includes a plunger positioned within the clamping sleeve, wherein a pressurized flowable medium provides pressure to the exterior of the tubular sidewall thereby causing the clamping sleeve to apply a clamping force to the plunger. | 03-04-2010 |
20100052233 | DOUBLE ACTING WORK SUPPORT WITH INTERNAL SEQUENCE CONTROL - A work support comprises a plunger, a transmission member, a first chamber, a second chamber, a third chamber, a clamping mechanism, a plug, and a body. The plunger may be slidably retained within the clamping mechanism, which in turn is firmly held within the transmission member. The transmission member may extend and retract from the body corresponding to a pressure in the first chamber and the second chamber. Extension of the transmission member also extends the plunger such that the plunger may contact and receive a load from a work piece. The third chamber may be located between the outer surface of the clamping mechanism and the inner surface of the transmission member. Increasing pressure in the first chamber while decreasing pressure in the second chamber extends the transmission member and opens the plug which blocks the entry to the third chamber. Pressure in the third chamber closes the gap between the clamping mechanism and the plunger and applies a clamping force to the plunger. | 03-04-2010 |
Patent application number | Description | Published |
20110170557 | System and Method for Traversing a Treelet-Composed Hierarchical Structure - A method for performing node traversal operations of a treelet-composed hierarchical structure includes allocating a queue for each of the plurality of treelets, each queue operable to store ray-states entering a respective one of the treelets. The method additionally includes determining that a ray-state exits a first treelet of the hierarchical structure and enters a second treelet of the hierarchical structure. The method further includes forwarding the ray-state entering the second treelet to a processing element for processing therein, wherein the queue allocated to store ray-states entering the second treelet is bypassed. | 07-14-2011 |
20120313961 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR OPTIMIZING STRATIFIED SAMPLING ASSOCIATED WITH STOCHASTIC TRANSPARENCY - A system, method, and computer program product are provided for optimizing stratified sampling associated with stochastic transparency. In use, surface data associated with one or more surfaces to be rendered is received. Additionally, the one or more surfaces are rendered, utilizing stochastic transparency, where stratified sampling associated with the stochastic transparency is optimized. | 12-13-2012 |
20120327071 | Clipless Time and Lens Bounds for Improved Sample Test Efficiency in Image Rendering - A method for reducing the number of samples tested for rendering a screen space region of an image includes constructing a trajectory of a primitive extending in an image which is to be rendered. A bounding volume is constructed for a screen space region of the image, the bounding volume characterized as having a bound in a non-screen space dimension which is defined as a function of the primitive's trajectory. The bounding volume is further characterized as overlapping a portion of the screen space region which is to be rendered. One or more sample points which are located within the screen space region, and which are not overlapped by the bounding volume are excluded from testing. | 12-27-2012 |
20130235031 | FULLY PARALLEL IN-PLACE CONSTRUCTION OF 3D ACCELERATION STRUCTURES IN A GRAPHICS PROCESSING UNIT - A system and method for constructing binary radix trees in parallel, which are used for as a building block for constructing secondary trees. A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method is disclosed. The method includes determining a plurality of primitives comprising a total number of primitive nodes that are indexed, wherein the plurality of primitives correspond to leaf nodes of a hierarchical tree. The method includes sorting the plurality of primitives. The method includes building the hierarchical tree in a manner requiring at most a linear amount of temporary storage with respect to the total number of primitive nodes. The method includes building an internal node of the hierarchical tree in parallel with one or more of its ancestor nodes. | 09-12-2013 |
20130235049 | FULLY PARALLEL IN-PLACE CONSTRUCTION OF 3D ACCELERATION STRUCTURES AND BOUNDING VOLUME HIERARCHIES IN A GRAPHICS PROCESSING UNIT - A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method for constructing bounding volume hierarchies from binary trees is disclosed. The method includes providing a binary tree including a plurality of leaf nodes and a plurality of internal nodes. Each of the plurality of internal nodes is uniquely associated with two child nodes, wherein each child node comprises either an internal node or leaf node. The method also includes determining a plurality of bounding volumes for nodes in the binary tree by traversing the binary tree from the plurality of leaf nodes upwards toward a root node, wherein each parent node is processed once by a later arriving corresponding child node. | 09-12-2013 |
20130235050 | FULLY PARALLEL CONSTRUCTION OF K-D TREES, OCTREES, AND QUADTREES IN A GRAPHICS PROCESSING UNIT - A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method for constructing k-d trees, octrees, and quadtrees from radix trees is disclosed. The method includes assigning a Morton code for each of a plurality of primitives corresponding to leaf nodes of a binary radix tree, and sorting the plurality of Morton codes. The method includes building a radix tree requiring at most a linear amount of temporary storage with respect to the leaf nodes, wherein an internal node is built in parallel with one or more of its ancestor nodes. The method includes, partitioning the plurality of Morton codes for each node of the radix tree into categories based on a corresponding highest differing bit to build a k-d tree. A number of octree or quadtree nodes is determined for each node of the k-d tree. A total number of nodes in the octree or quadtree is determined, allocated and output. | 09-12-2013 |
20140071129 | METHOD AND SYSTEM FOR GRAPHICS RENDERING EMPLOYING GRADIENT DOMAIN METROPOLIS LIGHT TRANSPORT - A method of generating an image. The method includes simulating a presence of at least one light source within a virtualized three dimensional space. Within the virtualized three dimensional space, a light sensing plane is defined. The light sensing plane includes a matrix of a number of pixels to be displayed on a display screen. The method further includes using a light transport procedure, computing a gradient value for each pixel of the matrix to produce a number of gradient values. The gradient computation involves selecting a plurality of light path pairs that contribute to a pixel wherein the selection is biased towards selection of more light paths that pass through pixels having larger gradient values. The plurality of gradient values are converted to a plurality of light intensity values which represent the image. | 03-13-2014 |
Patent application number | Description | Published |
20140123150 | HARDWARE SCHEDULING OF ORDERED CRITICAL CODE SECTIONS - One embodiment sets forth a technique for scheduling the execution of ordered critical code sections by multiple threads. A multithreaded processor includes an instruction scheduling unit that is configured to schedule threads to process ordered critical code sections. A ordered critical code section is preceded by a barrier instruction and when all of the threads have reached the barrier instruction, the instruction scheduling unit controls the thread execution order by selecting each thread for execution based on logical identifiers associated with the threads. The logical identifiers are mapped to physical identifiers that are referenced by the multithreaded processor during execution of the threads. The logical identifiers are used by the instruction scheduling unit to control the order in which the threads execute the ordered critical code section. | 05-01-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 |
20140282566 | SYSTEM AND METHOD FOR HARDWARE SCHEDULING OF INDEXED BARRIERS - A method and a system are provided for hardware scheduling of indexed 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, the thread pauses execution of the instructions. A first sub-group of threads in the plurality of threads is associated with a first sub-barrier index and a second sub-group of threads in the plurality of threads is associated with a second sub-barrier index. When the barrier instruction can be scheduled for execution, threads in the first sub-group are executed serially and threads in the second sub-group are executed serially and at least one thread in the first sub-group is executed in parallel with at least one thread in the second sub-group. | 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 |
20140351276 | SORTING WITH KEY MODIFICATION - This disclosure is directed to systems and methods for sorting data in which pre-sorting operations are performed on keys prior to those keys being reordered within memory. One example method includes generating, for each of a plurality of keys, an associated modified key. This operation is an example pre-sorting operation that occurs prior to any reordering of the keys. Once the modified keys are generated, the modified keys and/or associated information are processed in order to change the ordering of the keys in memory. | 11-27-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 |
20150178961 | SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR ANGULAR SUBDIVISION OF QUADRATIC BEZIER CURVES - A system, method, and computer program product are provided for subdividing a quadratic Bezier curve. The method includes the steps of receiving a quadratic Bezier curve defined by a plurality of control points including at least a first endpoint and a second endpoint. The quadratic Bezier curve is uniformly subdivided based on an angle between a first tangent at the first endpoint and a second tangent at the second endpoint to produce a piecewise representation of the quadratic Bezier curve including two or more Bezier curve segments. | 06-25-2015 |