Abstract: Various embodiments include techniques for generating topological data for a mesh included in a computer-generated environment. The mesh includes simple geometric shapes, such as triangles. The disclosed techniques identify vertices in the mesh that have the same position and have identical attributes, such as color, normal vector, and texture coordinates. The disclosed techniques further identify vertices in the mesh that have the same position but differ in one or more attributes. The techniques generate lists of the triangles that are adjacent to each vertex included in the mesh. The techniques generate a list of the unique edges included in the mesh. Further, the techniques are well suited for execution on highly parallel processors, such as graphics processing units, thereby reducing the time to generate this topological data. The topological data may then be efficiently used by other computer graphics processing operations.

Abstract: Various embodiments include techniques for performing parallel edge decimation on a high resolution mesh by collapsing multiple edges in parallel by blocking only the neighbor edges of the edges selected as collapse candidates. Effectively, the disclosed techniques dynamically partition the mesh into small partitions around the collapse candidates. In this manner, the techniques identify all the edges that may be independently collapsed in a single, now parallel, iteration. Edge decimation may be performed so that certain computational geometry techniques can be efficiently applied to a simpler mesh. In so doing, the disclosed techniques preserve the history of how the edge decimation process displaces the vertices of the original mesh to generate the simplified mesh. As a result, the results of the computational geometry techniques as applied to the simplified mesh can be propagated back to the original mesh.

Abstract: Approaches presented herein provide systems and methods to identify connected components within an object using an assigned label. The assigned label may be propagated through a number of connected components to identify a number of components having the same assigned label. Index values for the assigned labels may also be identified within a memory buffer to determine a range within the buffer for the connected component and to group and store each of the individual component within a contiguous sequence.

Abstract: Approaches in accordance with various embodiments can perform spatial hash map updates while ensuring the atomicity of the updates for arbitrary data structures. A hash map can be generated for a dataset where entries in the hash map may correspond to multiple independent values, such as pixels of an image to be rendered. Update requests for independent values may be received on multiple concurrent threads, but change requests for independent values corresponding to a hash map entry can be aggregated from a buffer and processed iteratively in a single thread for a given hash map entry. In the case of multi-resolution spatial hashing where data can be stored at various discretization levels, this operation can be repeated to propagate changes from one level to another.

Abstract: An agricultural machine for distributing product for feeding animals and/or forming their bedding, the agricultural distribution machine includes a casing and a loading door articulated in rotation on the casing about a first swivel axis, a complementary element articulated in rotation on the door about a second swivel axis and one main cylinder for operating the door, the or each main cylinder is articulated in rotation on the casing about a third swivel axis and on the complementary element about a fourth swivel axis and which further includes a rotation management device for the complementary element relative to the door including the or each main cylinder and one rotation switch configured to generate the rotational drive of the complementary element relative to the door based on the torque applied to the complementary element by the or each main cylinder.

Abstract: Various embodiments include techniques for lock-free, unordered in-place compaction of an array. The techniques include receiving a first array that includes a first plurality of data entries, generating a second array that includes a second plurality of data entries, and storing, in the second array, respective index positions of valid data entries included in the first array and invalid data entries included in the first array. The techniques further include determining invalid data entries included in a first portion of the first array based at least on the index positions, determining valid data entries included in a second portion of the first array based at least on the index positions, and replacing contents of the invalid data entries included in the first portion of the first array with contents of the valid data entries included in the second portion of the first array.

Abstract: Systems and methods to implement a technique for determining an environment importance sampling function. An environment map may be provided where lighting information about the environment is known, but where certain pixels within a scene associated with the environment map are shaded. From these shaded pixels, rays may be drawn in random directions to determine whether the rays are occluded or can interact with the environment map, which provides an indication of a source of lighting that can be used for light transport simulations. A mask may be generated based on these occlusions and used to update the environment importance sampling function.

Abstract: Systems and methods implement a technique for altering the shape of the cells by shifting coordinates of points along cell boundaries using a set of periodic functions. To avoid having cell boundaries along the scene surfaces, wavelengths of those periodic functions are selected so they are not a multiple of an original discretization. The coordinates may be shifted along different axes of the cells and may generate different cells having a variety of different outlines to reduce a likelihood of a cell boundary being positioned along a scene boundary.

Abstract: The present invention relates to an agricultural machine for distributing products for animal feeding and/or straw bedding comprising a bin for receiving the products, a distribution blower, a product ejection zone, a rotary element fitted with blades mounted in the ejection zone, a drive shaft of the rotary element, a conveyor and/or unraveling system and a rotary indicator positioned outside the ejection zone and able to be driven in rotation directly or indirectly by the drive shaft to send to a user, by its own visual rotation effect, a visual indication of the rotation of the rotary element.

Abstract: Approaches in accordance with various embodiments can perform spatial hash map updates while ensuring the atomicity of the updates for arbitrary data structures. A hash map can be generated for a dataset where entries in the hash map may correspond to multiple independent values, such as pixels of an image to be rendered. Update requests for independent values may be received on multiple concurrent threads, but change requests for independent values corresponding to a hash map entry can be aggregated from a buffer and processed iteratively in a single thread for a given hash map entry. In the case of multi-resolution spatial hashing where data can be stored at various discretization levels, this operation can be repeated to propagate changes from one level to another.

Abstract: Various embodiments include techniques for lock-free, unordered in-place compaction of an array. The techniques include receiving a first array that includes a first plurality of data entries, generating a second array that includes a second plurality of data entries, and storing, in the second array, respective index positions of valid data entries included in the first array and invalid data entries included in the first array. The techniques further include determining invalid data entries included in a first portion of the first array based at least on the index positions, determining valid data entries included in a second portion of the first array based at least on the index positions, and replacing contents of the invalid data entries included in the first portion of the first array with contents of the valid data entries included in the second portion of the first array.

Abstract: Systems and methods to implement a technique for determining an environment importance sampling function. An environment map may be provided where lighting information about the environment is known, but where certain pixels within a scene associated with the environment map are shaded. From these shaded pixels, rays may be drawn in random directions to determine whether the rays are occluded or can interact with the environment map, which provides an indication of a source of lighting that can be used for light transport simulations. A mask may be generated based on these occlusions and used to update the environment importance sampling function.

Abstract: An agricultural machine for distributing product for feeding animals and/or forming their bedding, the agricultural distribution machine includes a casing and a loading door articulated in rotation on the casing about a first swivel axis, a complementary element articulated in rotation on the door about a second swivel axis and one main cylinder for operating the door, the or each main cylinder is articulated in rotation on the casing about a third swivel axis and on the complementary element about a fourth swivel axis and which further includes a rotation management device for the complementary element relative to the door including the or each main cylinder and one rotation switch configured to generate the rotational drive of the complementary element relative to the door based on the torque applied to the complementary element by the or each main cylinder.

Abstract: Approaches in accordance with various embodiments can perform spatial hash map updates while ensuring the atomicity of the updates for arbitrary data structures. A hash map can be generated for a dataset where entries in the hash map may correspond to multiple independent values, such as pixels of an image to be rendered. Update requests for independent values may be received on multiple concurrent threads, but change requests for independent values corresponding to a hash map entry can be aggregated from a buffer and processed iteratively in a single thread for a given hash map entry. In the case of multi-resolution spatial hashing where data can be stored at various discretization levels, this operation can be repeated to propagate changes from one level to another.

Abstract: Approaches in accordance with various embodiments can perform spatial hash map updates while ensuring the atomicity of the updates for arbitrary data structures. A hash map can be generated for a dataset where entries in the hash map may correspond to multiple independent values, such as pixels of an image to be rendered. Update requests for independent values may be received on multiple concurrent threads, but change requests for independent values corresponding to a hash map entry can be aggregated from a buffer and processed iteratively in a single thread for a given hash map entry. In the case of multi-resolution spatial hashing where data can be stored at various discretization levels, this operation can be repeated to propagate changes from one level to another.

Abstract: Various embodiments include techniques for lock-free, unordered in-place compaction of an array. The techniques include receiving a first array that includes a first plurality of data entries, generating a second array that includes a second plurality of data entries, and storing, in the second array, respective index positions of valid data entries included in the first array and invalid data entries included in the first array. The techniques further include determining invalid data entries included in a first portion of the first array based at least on the index positions, determining valid data entries included in a second portion of the first array based at least on the index positions, and replacing contents of the invalid data entries included in the first portion of the first array with contents of the valid data entries included in the second portion of the first array.

Abstract: Various embodiments include techniques for performing parallel edge decimation on a high resolution mesh by collapsing multiple edges in parallel by blocking only the neighbor edges of the edges selected as collapse candidates. Effectively, the disclosed techniques dynamically partition the mesh into small partitions around the collapse candidates. In this manner, the techniques identify all the edges that may be independently collapsed in a single, now parallel, iteration. Edge decimation may be performed so that certain computational geometry techniques can be efficiently applied to a simpler mesh. In so doing, the disclosed techniques preserve the history of how the edge decimation process displaces the vertices of the original mesh to generate the simplified mesh. As a result, the results of the computational geometry techniques as applied to the simplified mesh can be propagated back to the original mesh.

Abstract: Various embodiments include techniques for generating topological data for a mesh included in a computer-generated environment. The mesh includes simple geometric shapes, such as triangles. The disclosed techniques identify vertices in the mesh that have the same position and have identical attributes, such as color, normal vector, and texture coordinates. The disclosed techniques further identify vertices in the mesh that have the same position but differ in one or more attributes. The techniques generate lists of the triangles that are adjacent to each vertex included in the mesh. The techniques generate a list of the unique edges included in the mesh. Further, the techniques are well suited for execution on highly parallel processors, such as graphics processing units, thereby reducing the time to generate this topological data. The topological data may then be efficiently used by other computer graphics processing operations.

Abstract: This application discloses techniques for generating and querying projective hash maps. More specifically, projective hash maps can be used for spatial hashing of data related to N-dimensional points. Each point is projected onto a projection surface to convert the three-dimensional (3D) coordinates for the point to two-dimensional (2D) coordinates associated with the projection surface. Hash values based on the 2D coordinates are then used as an index to store data in the projective hash map. Utilizing the 2D coordinates rather than the 3D coordinates allows for more efficient searches to be performed to locate points in the 3D space. In particular, projective hash maps can be utilized by graphics applications for generating images, and the improved efficiency can, for example, enable a game streaming application on a server to render images transmitted to a user device via a network at faster frame rates.

Abstract: Approaches presented herein provide systems and methods for lighting a scene in world-space. The systems and methods may generate lighting effects based on both temporally averaged world-space lighting data and screen-space spatial filtering. The lighting data may be based on material properties for objects within an image, where different material properties may lead to larger weighting factors based on a one or more optical properties of an object surface.