# Patent

## Title
Applications of interval arithmetic for reduction of number of computations in ray tracing problems

## Abstract

Embodiments provide for ray tracing traversal that relies on selected geometrical properties of the application to reduce the number of operations required during each traversal step. The traversal algorithm does not depend on the number of rays in the group. As a result, multi-level traversal schemes may be implemented, starting with a large number of rays in a group and then reducing it as needed to maintain group coherency. Multi-level traversal schemes may be created by splitting large groups of rays while traversing acceleration structures.

## Background
BACKGROUND
Implementations of the claimed invention generally may relate to ray tracing and, more particularly, to interval arithmetic for ray tracing.
Ray tracing is a well know method used in modeling of a variety of physical phenomena related to wave propagation in various media. For example it is used for computing an illumination solution in photorealistic computer graphics, for complex environment channel modeling in wireless communication, aureal rendering in advanced audio applications, etc.
A ray is a half line of infinite length originating at a point in space described by a position vector which travels from said point along a direction vector. Ray tracing is used in computer graphics to determine visibility by directing one or more rays from a vantage point described by the ray's position vector along a line of sight described by the ray's direction vector. To determine the nearest visible surface along that line of sight requires that the ray be effectively tested for intersection against all the geometry within the virtual scene and retain the nearest intersection.
When working with real values, data is often approximated by floating-point (FP) numbers with limited precision. FP representations are not uniform through the number space, and usually a desired real value (i.e. 1⁄3) is approximated by a value that is less than or greater than the desired value. The error introduced is often asymmetrical—the difference between the exact value and the closest lower FP approximation may be much greater or less than the difference to the closest higher FP approximation. Such numerical errors may be propagated and accumulate though all the computations, sometimes creating serious problems.
One way to handle such numerical inaccuracies is to use intervals instead of FP approximations. In this case, any real number is represented by 2 FP values: one is less than the real one, and another is greater than the real one. The bound values are preserved throughout all computations, yielding an interval, which covers the exact solution. Usually, applications using interval arithmetic are limited to certain classes of workloads (such as quality control, economics or quantum mechanics) where the additional costs of such interval computations significantly outweigh the implications of dealing with inexact FP numbers for any final values.



BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate one or more implementations consistent with the principles of the invention and, together with the description, explain such implementations. The drawings are not necessarily to scale, the emphasis instead being placed upon illustrating the principles of the invention. In the drawings
FIG. 1 illustrates an example of multiple rays traced through a cell from a common origin, executed during traversal of a binary tree.
FIG. 2 illustrates an example of interval implementation of traversing multiple rays through a binary tree.
FIG. 3 is a flow chart illustrating a process of traversing multiple rays through a binary tree using an interval technique.



DETAILED DESCRIPTION
The following detailed description refers to the accompanying drawings. The same reference numbers may be used in different drawings to identify the same or similar elements. In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular structures, architectures, interfaces, techniques, etc. in order to provide a thorough understanding of the various aspects of the claimed invention. However, it will be apparent to those skilled in the art having the benefit of the present disclosure that the various aspects of the invention claimed may be practiced in other examples that depart from these specific details. In certain instances, descriptions of well known devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail.
Embodiments provide for ray tracing traversal that relies on selected geometrical properties of the application to reduce the number of floating point (or other data type operations such as integer, fixed point) operations required during each traversal step. The interval traversal algorithm does not depend on the number of rays in the group. Multi-level traversal schemes may be implemented, starting with a large number of rays in a group and then reducing it as needed to maintain group coherency. Additional rays may be generated during traversal to improve anti-aliasing properties of the resulting image in areas of high geometrical complexity. The interval traversal algorithm groups parallel geometrical queries, extracts selected common geometrical characteristics pertinent for the whole group, and then executes a query using only these characteristics (and not the whole group). Ray tracing is based on massively parallel geometrical queries, executed against some spatially ordered geometrical database. The interval traversal algorithm may be extended to cover other types of applications, where it may be possible to find and trace certain group properties against a specialized database. One skilled in the art will recognize that embodiments of the invention are not limited to floating point implementation. Rather, the embodiments of the invention may be implemented using various data types, including but not limited to integer, fixed point and so forth.
FIG. 1 illustrates an example 100 of multiple rays 102 traced through a cell 104 from a common origin 106 for traversal of a binary tree. One cell 104 is split into two subspaces including a nearest cell C0 108 and furthest cell C1 110 by split plane P0. Rays 102 may be shot through pixels on the screen into a database representing all of the objects in a scene. These objects (suitably sub-divided) and data may represent empty space, and may be stored in a hierarchical spatial partitioning structure. Shooting a ray 102 involves tracing the path the ray 102 may take through this structure. Opportunities for parallelism exist but are limited, as each ray may take a different path through the database, and since the data structure is hierarchical, there is a sequential dependency as the ray goes from one level to the next.
The database may represent the distribution of objects and empty space as a collection of axis aligned spatial intervals. A collection of rays may be directly tested against any arbitrary level of the database hierarchy (i.e. not necessary starting at the top). The bundles of rays may be subdivided proceeding down the structure.
This results in improved numerical fidelity and simplifies the process of tracing rays. In particular, the number of operations required per ray is reduced, resulting in an improvement in overall application performance. Furthermore, hardware may be designed to directly implement such interval arithmetic, allowing additional performance improvement. Shooting of rays is not particular to graphics, similar technology may also used to track the propagation of waves of various kinds, calculating radar cross sections for military purposes etc.
In a ray tracing environment, it may be required to shoot lots of rays. One way to accomplish this is to determine the intersection of all rays against all of the polygons that define all of the geometrical objects in the scene.
Another way to accomplish this is to partition all of these polygons into an axis aligned partitioning structure. One implementation of this is to split the entire scene up into a uniform grid of cubes, while replicating polygons that straddle the cube boundaries. A ray may be shot and the cubes the ray passes through predicted. The ray is only tested against the contents of each of these cubes, ignoring the rest. Due to the relative efficiency of using such a representation versus testing every ray against every polygon, the term “acceleration structure” may be used to describe any such data structure designed to reduce the total number of ray-polygon intersection tests.
The above uniform grid of cubes has the advantage that the trajectory of a ray through the cubes may be calculated easily, and the relevant data accessed directly. The detail in the scene may not be distributed evenly though. For example, a huge amount of polygons may end up in one cube, and very little detail in the others.
Another acceleration structure construct is commonly referred to as a kd-tree. In this acceleration structure, some cost function may be used to recursively split the scene by axis-aligned planes. Initially, the scene may be split in two by such a plane, each half may then be split again along some other plane, and so forth. This results in a hierarchical organization of the structure. Each level of the acceleration structure may be recursively traversed to determine where the next level of the structure can be found. Cost functions are carefully chosen in the construction phase of these structures to achieve optimum performance while traversing these trees later when shooting the various rays needed for visualization.
The leaf nodes of a kd-tree represent a small axis aligned cell wherein there is some number of polygons. At the next level up the tree, each node represents an axis aligned box which is completely filled by two of the leaf nodes (a “split-plane” splits the larger volume into the two leaf cells). At the next level, each node represents an axis aligned box completely filled by two of the lower level nodes using a similar split-plane and so on. The tree is not required to be balanced, that is any internal node may be split into leaf node and another internal node. At any given level, a ray may be intersected against the bounding box to determine whether: (1) the ray completely misses the box, (2) the ray hits the box and passes through the “left” sub-node—i.e. to the “left” of the split-plane, (3) the ray hits the box and passes through the “right” sub-box, or (4) the ray hits and passes through both of the sub-boxes. In the first case (1), the further processing of the lower level nodes is no longer necessary, as the ray “misses” the entire lower part of the tree.
Embodiments of the invention are applicable to many acceleration structures, including those that use separation planes to determine which objects have to be tested for a particular ray. These acceleration structures include but are not limited to grids, bounding boxes and kd-trees.
Referring to FIG. 1, For any given block of rays, the traversal algorithms determine if the rays 102:

    (1) pass through subspace 108 to the left of the split-plane 104;
    (2) pass through the subspace 110 to the right of the split-plane 104; or
    (3) passes through both sub-spaces 108 and 110.


During full traversal of a binary tree, for each ray 102, the cell entry and exit points are known. These are the distances represented by oa, ob, oc, od, and oA, oB, oC, oD which are known from previous computations. The intersection points with the split-plane P0 are calculated. They are represented as distances oα, oβ, oχ, and oδ. Entry and exit distances are compared with the plane intersection. For example, referring to FIG. 1, rays oa and ob will go only through the left cell 108, while rays oc and od go through both cells 108 and 110. The process is repeated for each subsequent cell that the rays pass through.
If the algorithm requires ray traversal of both cells 108 and 110, then all information, pertinent to the furthest cell such as 110, is stored in a stack-like structure. It includes, in particular, the distances to the entry points oχ and oδ and the exit points oC and oD. The nearest cell 108 is recursively traversed first by executing all of the steps of the current processs with entry points a, b, c, and d and exit points A, B, χ, and δ. Once all cells within the nearest one have been traversed, the furthest cell data 110 is retrieved from the stack and the whole process is repeated.
If some cell contains primitive objects (such as triangles), the remaining rays which pass through this cell are tested against these objects. For example, ray/triangle intersection tests are performed.
In some cases, for each ray, a primitive object has been discovered such that the distance to it is less than the distance to the current cell. In this case, subsequent traversal steps are not necessary. If ray tracing is being used for rendering purposes, this refinement may be used if such a primitive object is opaque.
FIG. 2 illustrates an example 200 of multiple rays 202 traced through a cell 204 from a common origin 206 for interval traversal of a binary tree. FIG. 2 shows the next traversal step after the cell is split. In particular, FIG. 1 shows the case where one cell is split into two subspaces C0 108 and C1 110 by split-plane P0. In FIG. 2, C0 208 is further split into C00 210 and the union of C2 212 and C3 214. No ray 202 intersects the nearer sub-space C00 210.
The interval traversal algorithm is built upon the calculation and maintenance of one single interval for a group of rays, which includes minimum and maximum distances for all the rays in the bunch from a selected point (camera position) to a particular cell. Instead of representing individual rays as 3D vectors pointing in particular directions, a collection of rays may be represented as a single 3D vector of intervals pointing approximately in some particular direction. Typically, the more coherent these rays are, the tighter the intervals may be. For each coordinate x, y, and z, this interval may be defined as minimum and maximum coordinate value among all rays. Similarly, the individual cells of the acceleration structure may be represented as intervals in x, y and z. Cells at any level of a hierarchical acceleration structure may be represented as such an interval. Upon traversing deeper into the acceleration structure, the vector of intervals representing one group of rays may be sub-divided into multiple groups of rays for efficiency. Higher degrees of ray coherency are typically found deeper in the acceleration structure.
FIG. 3 is a flow chart illustrating a process 300 of interval traversal of a binary tree. Although process 300 may be described with regard to FIG. 2 for ease of explanation, the claimed invention is not limited in this regard. Acts 302, 304, and 306 of the FIG. 3 are executed once per traversal step, while acts 308-316 are executed for each traversed cell.
In act 302, a group of rays is generated and some common characteristics of the group of rays are computed. For those rays generated from a particular common point of origin such as camera position o through a screen with pixels pxy, the following are computed for each coordinate axis:
In act 304, the minimum and maximum distance values among all projections of direction vectors opxy on any given axis are computed. By definition, for every ray in the group, the x, y, and z coordinates of opxy vector will be inside an appropriate interval. At the beginning of the top cell traversal (act 304), the minimum and maximum distances oa1 and oA1 are determined. These may be designated as interval [oa1, oA1]. This interval is maintained and potentially modified (narrowed) during the remaining traversal process. By definition, for any ray in the group, the distance to the nearest cell entry point is not less than oa1 and the distance to the furthest cell exit point is less or equal to oA1.
In act 306, inverse direction intervals are defined.
In act 308, the minimum and maximum distances to the split plane odmin and odmax may be computed using inverse direction intervals defined in act 306.
As shown in FIG. 2, sub-cells C2 212 and C3 214 are split by plane P2. It is determined whether both sub-cells C2 212 and C3 214 are traversed. In particular, this is determined by evaluating the following two conditions, which if satisfied, result in traversing only one sub-cell:
In act 310, if the minimum distance to the cell (oa1) is more than maximum distance to the plane (oA2), the [oa1, oA1] interval is modified and only the right sub-cell is traversed (act 312).
In act 314, if the maximum distance to the cell (oA1) is less than minimum distance to the plane (oa3), the [oa1, oA1] interval is modified and only the left sub-cell is traversed (act 316).
If neither of these conditions are true, both sub-cells have to be traversed (act 318) and appropriate intervals have to be modified. As shown in FIG. 2, during C2 traversal, the interval will be [oa1, oA2]. For the cell C3, it will be [oa3, oA1].
One skilled in the art will recognize that different implementations of the interval traversal embodiments described herein are possible. For example, embodiments described can be extended to ray groups which do not have a common origin. Although process 300 may be implemented on modern vector or SIMD (Single Instruction Multiple Data) machines, the claimed invention is not limited in this regard.
Certainly, different implementations of the interval traversal algorithm are possible. One, provided above, is used only for presentation purposes, as well as particular cases featured on the supplied figures. It is also possible to extend the ideas, outlined here, to a more general case of ray bunches, which do not have common origin. The following observation helps to understand the differences between the full and the interval traversal algorithms. The full algorithm basically implements simultaneous bounding box clipping of a particular group of rays. For any given cell, reached in the acceleration structure, the entry and exit points for all rays are known. The interval algorithm shown in FIG. 3 represents a lazy distributed box clipping, yielding guaranteed minimum and maximum clipping distances for the whole group of rays.
Embodiments of the invention may sharply reduce the number of floating point or other data type operations required during each traversal step. Unlike the full traversal algorithm, the interval traversal algorithm does not depend on the number of rays in the group. Multi-level traversal schemes may be implemented starting with a large number of rays in a group and then reducing it as needed to maintain group coherency. The interval traversal algorithm, if implemented or supported in hardware, may enable a sharp reduction of power, consumed by the device, as well as increasing overall performance. Ray tracing is based on massively parallel geometrical queries, executed against some spatially ordered geometrical database. The interval traversal algorithm consists of grouping such queries, extracting certain common geometrical characteristics, pertinent for the whole group, and then executing a query using only these characteristics (and not the whole group). As such, the interval traversal approach may be extended to cover other types of applications, where it may be possible to find and trace certain group properties against a specialized database.
Although systems are illustrated as including discrete components, these components may be implemented in hardware, software/firmware, or some combination thereof. When implemented in hardware, some components of systems may be combined in a certain chip or device.
Although several exemplary implementations have been discussed, the claimed invention should not be limited to those explicitly mentioned, but instead should encompass any device or interface including more than one processor capable of processing, transmitting, outputting, or storing information. Processes may be implemented, for example, in software that may be executed by processors or another portion of local system.
The foregoing description of one or more implementations consistent with the principles of the invention provides illustration and description, but is not intended to be exhaustive or to limit the scope of the invention to the precise form disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practice of various implementations of the invention.
No element, act, or instruction used in the description of the present application should be construed as critical or essential to the invention unless explicitly described as such. Also, as used herein, the article “a” is intended to include one or more items. Variations and modifications may be made to the above-described implementation(s) of the claimed invention without departing substantially from the spirit and principles of the invention. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims.

## Claims

1. A computer-implemented method for ray tracing, comprising:
generating a group of rays having a common point of origin;
computing minimum and maximum distances values among all projections of direction vectors on any given axis;
defining inverse direction intervals representative of the group of rays;
computing minimum and maximum distances to a split plane using inverse direction intervals;
determining whether sub-cells in a split plane are traversed, comprising:
modifying the interval and traversing only one sub cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane.

2. The computer-implemented method claimed in claim 1, wherein modifying the interval and traversing only one sub cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane further comprises:
in response to the minimum distance to the cell being more than maximum distance to the plane, modifying the interval and traversing only a first sub-cell.

3. The computer-implemented method claimed in claim 1, wherein modifying the interval and traversing only one sub cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane further comprises:
in response to the maximum distance to the cell being less than minimum distance to the plane, modifying the interval and traversing only a second sub-cell.

4. The computer-implemented method claimed in claim 1, further comprising:
modifying intervals and traversing both sub cells if neither condition is met.

5. A tangible machine-accessible medium including instructions that, when executed, cause a machine to:
generate a group of rays having a common point of origin;
compute minimum and maximum distances values among all projections of direction vectors on any given axis;
define inverse direction intervals representative of the group of rays;
compute minimum and maximum distances to a split plane using inverse direction intervals;
determine whether sub-cells in a split plane are traversed, comprising:
modify the interval and traverse a cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane.

6. An apparatus, comprising:
a database; and
a controller for generating a group of rays having a common point of origin, computing minimum and maximum distances values among all projections of direction vectors on any given axis, defining inverse direction intervals representative of the group of rays, computing minimum and maximum distances to a split plane using inverse direction intervals, determining whether sub-cells in a split plane are traversed, comprising modifying the interval and traversing a cell if the minimum distance to the cell is more than the maxsmum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane.

7. An system, comprising:
a memory including a database; and
a controller for generating a group of rays having a common point of origin, computing minimum and maximum distances values among all projections of direction vectors on any given axis, defining inverse direction intervals representative of the group of rays, computing minimum and maximum distances to a split plane using inverse direction intervals, determining whether sub-cells in a split plane are traversed, comprising modifying the interval and traversing a cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane.

8. A computer-implemented method for ray tracing, comprising:
generating a group of rays having a common point of origin:
computing minimum and maximum distances values among all projections of direction vectors on any given axis;
defining inverse direction intervals representative of the group of rays;
computing minimum and maximum distances to a split plane using inverse direction intervals;
determining whether sub-cells in a split plane are traversed, comprising:
modifying the interval and traversing a cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane.

9. The computer-implemented method claimed in claim 8, wherein modifying the interval and traversing a cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane further comprises:
in response to the minimum distance to the cell being more than maximum distance to the plane, modifying the interval and traversing only a first sub-cell.

10. The computer-implemented method claimed in claim 8, wherein modifying the interval and traversing a cell if the minimum distance to the cell is more than the maximum distance to the plane or the maximum distance to the cell is less then the minimum distance to the plane further comprises:
in response to the maximum distance to the cell being less than minimum distance to the plane, modifying the interval and traversing only a second sub-cell.

11. The computer-implemented method claimed in claim 8, further comprising:
modifying intervals and traversing both sub cells if neither condition is met.