Beam tracing

US9569559B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9569559-B2
Application numberUS-201514662090-A
CountryUS
Kind codeB2
Filing dateMar 18, 2015
Priority dateSep 4, 2014
Publication dateFeb 14, 2017
Grant dateFeb 14, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

An apparatus, computer readable medium, and method are disclosed for performing an intersection query between a query beam and a target bounding volume. The target bounding volume may comprise an axis-aligned bounding box (AABB) associated with a bounding volume hierarchy (BVH) tree. An intersection query comprising beam information associated with the query beam and slab boundary information for a first dimension of a target bounding volume is received. Intersection parameter values are calculated for the first dimension based on the beam information and the slab boundary information and a slab intersection case is determined for the first dimension based on the beam information. A parametric variable range for the first dimension is assigned based on the slab intersection case and the intersection parameter values and it is determined whether the query beam intersects the target bounding volume based on at least the parametric variable range for the first dimension.

First claim

Opening claim text (preview).

What is claimed is: 1. A method, comprising: receiving, by a computer system, an intersection query comprising beam information associated with a query beam, the query beam comprising a plurality of query rays; receiving, by the computer system, slab boundary information for a first dimension of a target bounding volume, the target bounding volume being a bounding box for a target object, and the slab boundary information for the first dimension of the target bounding volume indicating a position range of the target bounding volume along the first dimension; calculating, by the computer system, intersection parameter values for the first dimension based on the beam information and the slab boundary information, the intersection parameter values calculated according to intersections of the query rays within the position range of the target bounding volume along the first dimension; determining, by the computer system, a slab intersection case for the first dimension based on the beam information, the slab intersection case being a combination of at least two of the intersection parameter values calculated for the first dimension; assigning, by the computer system, a parametric variable range for the first dimension based on the slab intersection case; determining, by the system, whether the query beam intersects the target bounding volume using the parametric variable range for the first dimension; responsive to determining that the query beam intersects the target bounding volume, performing, by the computer system, additional intersection analysis between each ray in the plurality of query rays and the target object; and generating, by the computer system, an image of the target object from true intersections determined from the additional intersection analysis. 2. The method of claim 1 , wherein the slab boundary information is specified within a three-dimensional space, and the first dimension corresponds to a coordinate axis of the three-dimensional space. 3. The method of claim 1 , wherein the target bounding volume comprises an axis-aligned bounding box. 4. The method of claim 1 , wherein the beam information comprises a first ray and a second ray specified within a three-dimensional space that includes the first dimension, the first ray associated with a first direction vector and a first origin, and the second ray associated with a second direction vector and a second origin. 5. The method of claim 4 , wherein determining the slab intersection case comprises comparing the first direction vector with zero in the first dimension and comparing the second direction vector with zero in the first dimension. 6. The method of claim 4 , wherein the slab boundary information comprises a slab minimum value and a slab maximum value for the first dimension. 7. The method of claim 4 , wherein calculating intersection parameter values comprises calculating a first intersection parameter value by performing a first multiplication between a first inverse component of the first direction vector and a first distance, and calculating a second intersection parameter value by performing a second multiplication between a second inverse component of the second direction vector and a second distance. 8. The method of claim 1 , wherein assigning a parametric range comprises assigning a minimum range value to a product of a first inverse component of a first direction vector of the query beam and a first distance between a first origin of the query beam and a slab minimum value associated with the slab boundary information, and assigning a maximum range value to a product of a second inverse component of a second direction vector of the query beam and a second distance between a second origin of the query beam and a slab maximum value associated with the slab boundary information. 9. The method of claim 1 , wherein the intersection query comprises an additional parametric variable range and determining whether the query beam intersects the target bounding volume comprises: assigning an overall parametric variable range bounded by a first value and a second value by: selecting the first value as a maximum value from a first set of values comprising minimum values of the parametric variable ranges for the intersection query and at least the first dimension; selecting the second value as a minimum value from a second set of values comprising maximum values of the parametric variable ranges for the intersection query and at least the first dimension; and determining that the query beam intersects the target bounding volume if the first value is less than or equal to the second value. 10. The method of claim 1 , wherein the query beam is generated according to a dilation operator applied to a query ray. 11. The method of claim 1 , wherein the plurality of query rays include a first query ray and a second query ray, and wherein the beam information includes a first query origin and a first query direction for the first query ray, and a second query origin and a second query direction for the second query ray. 12. The method of claim 11 , wherein the bounding box for the target object is defined by bounding planes in each dimension of coordinate space occupied by the target object, and wherein the position range of the target bounding volume along the first dimension includes a minimum position of the target bounding volume along the first dimension and a maximum position of the target bounding volume along the first dimension. 13. The method of claim 12 , wherein the intersection parameters values include: first intersection parameter values calculated, respectively, according to an intersection between the minimum position of the target bounding volume and each of the first query ray and the second query ray, and second intersection parameter values calculated, respectively, according to an intersection between the maximum position of the target bounding volume and each of the first query ray and the second query ray. 14. The method of claim 13 , wherein the slab intersection case is a combination of: at least one value of the first intersection parameter values, and at least one value of the second intersection parameter values. 15. A system, comprising: a memory configured to store a target bounding volume, the target bounding volume being a bounding box for a target object; and a processing unit coupled to the memory and configured to: receive an intersection query comprising beam information associated with a query beam, the query beam comprising a plurality of query rays; receive slab boundary information for a first dimension of the target bounding volume, the slab boundary information for the first dimension of the target bounding volume indicating a position range of the target bounding volume along the first dimension; calculate intersection parameter values for the first dimension based on the beam information and the slab boundary information, the intersection parameter values calculated according to intersections of the query rays within the position range of the target bounding volume along the first dimension; determine a slab intersection case for the first dimension based on the beam information, the slab intersection case being a combination of at least two of the intersection parameter values calculated for the first dimension; assign a parametric variable range for the first dimension based on the slab intersection case; determine whether the query beam intersects the target bounding volume using the parametric variable range for the first dimension; responsive to determining that the query beam int

Assignees

Inventors

Classifications

  • Model-based coding, e.g. wire frame · CPC title

  • Tree coding, e.g. quadtree, octree · CPC title

  • Constructive solid geometry [CSG] using solid primitives, e.g. cylinders, cubes · CPC title

  • Ray-tracing · CPC title

  • Volume rendering · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9569559B2 cover?
An apparatus, computer readable medium, and method are disclosed for performing an intersection query between a query beam and a target bounding volume. The target bounding volume may comprise an axis-aligned bounding box (AABB) associated with a bounding volume hierarchy (BVH) tree. An intersection query comprising beam information associated with the query beam and slab boundary information f…
Who is the assignee on this patent?
Nvidia Corp
What technology area does this patent fall under?
Primary CPC classification G06F16/9027. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Feb 14 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).