HASH CELL BOUNDARY SHIFTING FOR LIGHT TRANSPORT SIMULATION SYSTEMS AND APPLICATIONS

    公开(公告)号:US20230298274A1

    公开(公告)日:2023-09-21

    申请号:US18170095

    申请日:2023-02-16

    Inventor: Pascal Gautron

    CPC classification number: G06T19/003 G06T7/586 G06F30/20

    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.

    Concurrent hash map updates
    2.
    发明授权

    公开(公告)号:US11609899B2

    公开(公告)日:2023-03-21

    申请号:US16930633

    申请日:2020-07-16

    Inventor: Pascal Gautron

    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.

    Projective hash maps
    3.
    发明授权

    公开(公告)号:US11925860B2

    公开(公告)日:2024-03-12

    申请号:US17343008

    申请日:2021-06-09

    CPC classification number: A63F13/355 A63F13/352 G06T17/10 G06T17/20

    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.

    CONCURRENT DATASET UPDATES USING HASH MAPS
    4.
    发明公开

    公开(公告)号:US20240338358A1

    公开(公告)日:2024-10-10

    申请号:US18745388

    申请日:2024-06-17

    Inventor: Pascal Gautron

    CPC classification number: G06F16/2379 G06F9/46 G06F16/2255 G06T15/06

    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.

    Concurrent hash map updates
    5.
    发明授权

    公开(公告)号:US12013844B2

    公开(公告)日:2024-06-18

    申请号:US18186751

    申请日:2023-03-20

    Inventor: Pascal Gautron

    CPC classification number: G06F16/2379 G06F9/46 G06F16/2255 G06T15/06

    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.

    PROJECTIVE HASH MAPS
    7.
    发明申请

    公开(公告)号:US20220395748A1

    公开(公告)日:2022-12-15

    申请号:US17343008

    申请日:2021-06-09

    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.

    CONCURRENT HASH MAP UPDATES
    9.
    发明申请

    公开(公告)号:US20220019573A1

    公开(公告)日:2022-01-20

    申请号:US16930633

    申请日:2020-07-16

    Inventor: Pascal Gautron

    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.

    CONCURRENT HASH MAP UPDATES
    10.
    发明公开

    公开(公告)号:US20230297562A1

    公开(公告)日:2023-09-21

    申请号:US18186751

    申请日:2023-03-20

    Inventor: Pascal Gautron

    CPC classification number: G06F16/2379 G06F16/2255 G06F9/46 G06T15/06

    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.

Patent Agency Ranking