Abstract: There is provided a method for ray-mediated illumination control. The method includes identifying a first activation region corresponding to one of an origin and a destination of a ray, where the ray is described by a ray data associated with the ray. The method further includes identifying a second activation region corresponding to the other one of the origin and the destination of the ray, interpreting an illumination rule for the ray based on at least one of the first activation region and the second activation region, and modifying an illumination in one of the first activation region and the second activation region based on the illumination rule and the ray data.

Abstract: According to one implementation, an animation system includes a computing platform having a hardware processor and a system memory storing a software code. The hardware processor executes the software code to receive pose data including rig control values for multiple animation rigs, and to store the rig control values for each animation rig in respective rig control caches identified with the animation rig. The hardware processor also executes the software code to receive constraint data linking one animation rig to one rig control cache identified with any animation rig, receive change data for one rig control value of that linked animation rig, update the rig control value based on the change data, and clear the rig control cache linked with the updated animation rig. Thus, updating any rig control value of an animation rig results in clearing rig control caches linked with that animation rig.

Abstract: According to one implementation, an animation system includes a computing platform having a hardware processor and a system memory storing a software code. The hardware processor executes the software code to receive pose data including rig control values for multiple animation rigs, and to store the rig control values for each animation rig in respective rig control caches identified with the animation rig. The hardware processor also executes the software code to receive constraint data linking one animation rig to one rig control cache identified with any animation rig, receive change data for one rig control value of that linked animation rig, update the rig control value based on the change data, and clear the rig control cache linked with the updated animation rig. Thus, updating any rig control value of an animation rig results in clearing rig control caches linked with that animation rig.

Abstract: Systems and methods are described for leveraging distributed computation systems to split animation application processing of node graphs into two components: 1) a low complexity, primary node graph, that is evaluated by the application of the local device; and 2) one or more, higher complexity, companion node graphs that connect to the primary node graph, and are evaluated by a distributed computation system. As the local device evaluates the original, low complexity node graph, an artist is provided with fast, direct manipulation of an animated object. At the same time, the distributed computation system evaluates the higher complexity, companion node graphs, thereby providing a user of the local application with higher fidelity versions of the primary node graph as they are computed.

Abstract: A distributed computation system is leveraged to evaluate many possible results of a rig near the current pose to obtain predicted poses. A user locally runs an animation application instance to manipulate an animated object including a rig and shape. Depending on a user's selection or modification of a rig control of the rig, changes to the rig control are predicted. Based on the predicted changes to the rig control, the distributed computation system evaluates the rig to obtain different predicted poses. The predicted poses are made available to an interpolator that blends the results to obtain an interpolated shape. In implementations, the distributed computation system may be used to evaluate predicted poses for animation ghosting.

Abstract: Systems and methods are described for leveraging distributed computation systems to split animation application processing of node graphs into two components: 1) a low complexity, primary node graph, that is evaluated by the application of the local device; and 2) one or more, higher complexity, companion node graphs that connect to the primary node graph, and are evaluated by a distributed computation system. As the local device evaluates the original, low complexity node graph, an artist is provided with fast, direct manipulation of an animated object. At the same time, the distributed computation system evaluates the higher complexity, companion node graphs, thereby providing a user of the local application with higher fidelity versions of the primary node graph as they are computed.

Abstract: A distributed computation system is leveraged to evaluate many possible results of a rig near the current pose to obtain predicted poses. A user locally runs an animation application instance to manipulate an animated object including a rig and shape. Depending on a user's selection or modification of a rig control of the rig, changes to the rig control are predicted. Based on the predicted changes to the rig control, the distributed computation system evaluates the rig to obtain different predicted poses. The predicted poses are made available to an interpolator that blends the results to obtain an interpolated shape. In implementations, the distributed computation system may be used to evaluate predicted poses for animation ghosting.

Abstract: There is provided a system including a hardware processor, a memory, and an illumination rendering unit including a virtual object discrimination module stored in the memory. The hardware processor is configured to execute the illumination rendering unit to perform a first, primitive render of an illumination of a scene including multiple virtual objects, and to determine a score for each of the virtual objects corresponding to its respective contribution to the illumination of the scene. The hardware processor is also configured to execute the illumination rendering unit to identify one or more of the virtual objects as disregardable based on their respective scores, and to perform a second render of the illumination of the scene while disregarding presence of the identified one or more virtual objects as disregardable in the scene.

Abstract: There is provided a system and method of distribution caching for direct lights in a scene. The system including a memory and a processor configured to execute a rendering software application to shoot a plurality of rays through a scene that includes a plurality of lights, generate a plurality of cache points at different locations throughout the scene based on the shooting of the plurality of rays, compute a list of lights for each cache point from the plurality of cache points, the list of lights including lights from the plurality of lights that provide illumination at a location of the cache point, and store the plurality of cache points in a memory. The processor may further be configured to execute the rendering software application to render the scene using the cache point database.

Abstract: There is provided a system and a method for ordering rays in rendered graphics for coherent shading. The method comprises recording, using the processor, intersection points for each of a plurality of directional queries in the memory, wherein each of the plurality of directional queries has one intersection point, organizing, using the processor, the intersection points in the memory into a plurality of elements, and grouping, using the processor, the intersection points in the memory by shading context. The method may further comprise shading the intersection points, wherein the shading is performed on a plurality of elements substantially concurrently. The shading context may include a volume of intersection points. In another implementation, the shading context may be one of texture ID, material ID, and element ID. Additionally, the texture ID may correspond to a mesh face ID.

Abstract: There is provided a system including a hardware processor, a memory, and an illumination rendering unit including a virtual object discrimination module stored in the memory. The hardware processor is configured to execute the illumination rendering unit to perform a first, primitive render of an illumination of a scene including multiple virtual objects, and to determine a score for each of the virtual objects corresponding to its respective contribution to the illumination of the scene. The hardware processor is also configured to execute the illumination rendering unit to identify one or more of the virtual objects as disregardable based on their respective scores, and to perform a second render of the illumination of the scene while disregarding presence of the identified one or more virtual objects as disregardable in the scene.

Abstract: There is provided a system and method of distribution caching for direct lights in a scene. The system including a memory and a processor configured to execute a rendering software application to shoot a plurality of rays through a scene that includes a plurality of lights, generate a plurality of cache points at different locations throughout the scene based on the shooting of the plurality of rays, compute a list of lights for each cache point from the plurality of cache points, the list of lights including lights from the plurality of lights that provide illumination at a location of the cache point, and store the plurality of cache points in a memory. The processor may further be configured to execute the rendering software application to render the scene using the cache point database.

Abstract: There is provided a method and system for fast pattern interpolation with parallel coherent random walk searching. The system includes a system processor and a system memory, and an image processing application stored in the system memory. The image processing application, under control of the system processor, is configured to receive first and second pattern exemplars and a blend map for merging the first and second pattern exemplars, and to utilize a correspondence search process to determine first and second target images for use in producing a composite image. The first and second target images correspond respectively to the first and second pattern exemplars. In addition, a constraint imposed on the correspondence search process by the image processing application is based on the blend map for merging the first and second pattern exemplars.

Abstract: A method is provided for distributed element rendering with particular application for feature films and other demanding content creation using scenes of high complexity requiring global illumination. A persistent centralized scheduler receives shading queries that are added to a request queue, determines an assignment of the request queue to hardware resources based on a resource map, and processes the request queue according to the assignment to render frames of one or more scenes. The resource map may be built by the scheduler and indicates local scene geometry cached for each of the hardware resources. By generating a full set of camera rays at each hardware resource, global illumination shading and other rendering can proceed independently against local geometry caches for high parallelism. Redundant computations are reduced through the scheduler, which may cache frequently requested rendering results including tessellation, shading, and level of detail.

Abstract: A method is provided for integration cone tracing with particular application for feature films and other demanding content creation using scenes of high complexity requiring global illumination. Instead of using a conventional noise prone ray tracer, cones are intersected with a scene bounding hierarchy to determine intersecting scene geometry, and integration results are computed by directional sampling within the cones. As a result, the working data set may be reduced as the rendering may begin with a smaller set of cones as compared to the large number of rays required for acceptable filtering in a conventional ray tracer. Furthermore, by refining the cones during the rendering only on an as-needed basis according to an acceptable noise threshold and by sharing secondary cone bounces among primary cones, the processing workload and data set requirements may be kept to a reasonable level even for multiple global illumination passes.

Abstract: Some aspects of the disclosure include systems and methods for grouping rays into sets according to their directions. In some cases, the rays of the directional sets may then be organized into a hierarchy according to their origins and bounding cones are generated for the hierarchy nodes. The resulting bounding cone hierarchy may be intersected with a bounding volume hierarchy or other scene hierarchy.

Abstract: A method is provided for streaming light propagation with particular application for feature films and other demanding content creation using scenes of high complexity requiring art directed global illumination. By attaching a data recording shader or equivalent functionality to any tracing based renderer that can provide multi-pass global illumination, the complete set of light bounce propagation records and the set of emissive samples for a particular rendering can be recorded to memory or disk. A user may edit the emissive samples to adjust the lighting environment, including modifying light source color and intensity and even moving and adding new emissive samples. To relight the scene, the edited emissive samples are processed through the propagation records using a streaming multiply-and-add operation amenable to high levels of parallelization, avoiding a costly re-rendering of the scene and providing a final quality result in interactive time.

Abstract: A method for a computer system including receiving a file comprising textures including a first and a second texture map, which can be regular or irregular texture maps, and metadata, wherein the metadata includes identifiers associated with texture maps and includes adjacency data, associating the first texture map with a first face of an object in response to an identifier associated with the first texture map, associating the second texture map with a second face of the object in response to an identifier associated with the second texture map, determining an edge of the first texture map is adjacent to an edge of the second texture map in response to the adjacency data, and performing a rendering operation with respect to the first and second faces of the object to determine rendering data in response to the first and second texture maps.

Abstract: A method is provided for a streaming hierarchy traversal renderer with particular application for feature films and other demanding content creation using scenes of high complexity that cannot fit in memory. The renderer organizes scene geometry into a spatial hierarchy, generates directional queries to be traced in the spatial hierarchy, performs a streaming hierarchy traversal over the directional queries, and uses the results of the directional queries to shade or render the scene. The traversal performs a single pass over the directional queries for splitting into one child stream of directional queries for each child node at each scene node in the hierarchy. A prioritized traversal of the hierarchy may also be carried out using various cost-metrics for optimized parallelism. The rendering may also bounce the directional queries to provide multi-pass global illumination.

Abstract: There is provided a method for ray-mediated illumination control. The method includes identifying a first activation region corresponding to one of an origin and a destination of a ray, where the ray is described by a ray data associated with the ray. The method further includes identifying a second activation region corresponding to the other one of the origin and the destination of the ray, interpreting an illumination rule for the ray based on at least one of the first activation region and the second activation region, and modifying an illumination in one of the first activation region and the second activation region based on the illumination rule and the ray data.