Back to results
US 12,118,643 B2Granted
Hardware-accelerated nearest neighbor queries for arbitrary data primitives
AssigneeNVIDIA Corporation
InventorNathan Vollmer Morrical
Life of this patent
Estimating the term…
Abstract
Apparatuses, systems, and techniques to perform a K-nearest-neighbor query. In at least one embodiment, a set of bounding boxes corresponding to a set of primitives is generated that allows the query to be solved using light transport simulation acceleration features of a GPU.
Claims31
A method comprising:
- receiving a request to identify, from a set of one or more primitives, a specified number of primitives based, at least in part, on performing a nearest neighbor query using a point of interest;
- generating a bounding box around each of the one or more primitives;
- and
- adjusting a number of the one or more primitives to be excluded from a result set of the request by adjusting a size of each of the one or more bounding boxes to change a number of the one or more bounding boxes that comprise the point of interest.
1 more element
A processor comprising one or more processing units to:
- receive a request to identify, from a set of one or more primitives, a specified number of primitives as a result of performing one or more nearest neighbor queries using a point of interest;
- generate a bounding box around each of the one or more primitives;
- and
- adjust a number of the one or more primitives to be excluded from a result set of the request by adjusting a size of each of the one or more bounding boxes based, at least in part, on modifying a number of one or more bounding boxes that include the point of interest.
1 more element
A non-transitory machine-readable medium having stored thereon a set of instructions, which if performed by one or more processors, cause the one or more processors to:
- receive a request to identify, from a set of one or more primitives, a specified number of primitives based, at least in part, on performing a set of nearest neighbor queries using a point of interest;
- generate a bounding box around each of the one or more primitives;
- and
- adjust a number of the one or more primitives to be excluded from a result set of the request by adjusting a size of each of the one or more bounding boxes to adjust a number of the one or more boxes that include the point of interest.
1 more element
Dependencies are inferred from the claim text.