Fast ray tracing by ray classification

Arvo, James; Kirk, David B.

doi:10.1145/37401.37409

Cited by 90 publications

(52 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This is mainly due to the extreme geometric simplicity of the scene, which plays to our disadvantage because our algorithm scales weakly with scene complexity (Section 4). Our spatial hierarchy does not currently include angular subdivisions [Arvo and Kirk 1987], and we may therefore process redundant splats on glossy surfaces, where the spatial supports are larger (Section 2.2). Another possible improvement is discussed in Section 4.…”

Section: Glossy Reflectionmentioning

confidence: 99%

Reconstructing the indirect light field for global illumination

et al. 2012

View full text Add to dashboard Cite

Stochastic techniques for rendering indirect illumination suffer from noise due to the variance in the integrand. In this paper, we describe a general reconstruction technique that exploits anisotropy in the light field and permits efficient reuse of input samples between pixels or world-space locations, multiplying the effective sampling rate by a large factor. Our technique introduces visibility-aware anisotropic reconstruction to indirect illumination, ambient occlusion and glossy reflections. It operates on point samples without knowledge of the scene, and can thus be seen as an advanced image filter. Our results show dramatic improvement in image quality while using very sparse input samplings.

show abstract

Section: Glossy Reflectionmentioning

confidence: 99%

Reconstructing the indirect light field for global illumination

et al. 2012

View full text Add to dashboard Cite

show abstract

“…However, a ray may still be tested against a number of cells and their contained primitives before an intersection is found. Arvo and Kirk [1987] describe a subdivision of 5D ray space, that eliminates this costly traversal of cells. A 5D cell is defined by a parallelepiped of ray origins in 3D (which we will call the origin box) and a range of ray directions.…”

Section: Previous Workmentioning

confidence: 99%

“…With the same objective in mind, we propose an approach based on Arvo and Kirk's [1987] ray classification technique. The original algorithm subdivides the scene using a 5D partition of ray space 1 .…”

Section: Introductionmentioning

confidence: 99%

Accelerating ray shooting through aggressive 5D visibility preprocessing

Sharpe

Hampton

Nirenstein

et al. 2003

Proceedings of the 2nd International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa

View full text Add to dashboard Cite

We present a new approach to accelerating general ray shooting. Our technique uses a five-dimensional ray space partition and is based on the classic ray-classification algorithm. Where the original algorithm evaluates intersection candidates at run-time, our solution evaluates them as a preprocess.The offline nature of our solution allows for an adaptive subdivision of ray space. The advantage being, that it allows for the placement of a user set upper bound on the number of primitives intersected.The candidate sets produced account for occlusion, thereby reducing memory requirements and accelerating the ray shooting process. A novel algorithm which exploits graphics hardware is used to evaluate the candidate sets. It is the treatment of occlusion that allows for the practical precomputation of the ray space partition. This algorithm is called aggressive since it is optimal (no invisible primitives are included), but may result in false exclusion of visible primitives. Error is minimised through the adaptive sampling.

show abstract

“…Related works The first attempts to cope with the cost of visibility computations involved space partitioning structures but they provided only local visibility information. Arvo and Kirk [1] subdivide the 5D ray-space for ray-tracing. Teller [13] uses the 5D Plücker duality to compute the antipenumbra cast by an area light source.…”

Section: Introductionmentioning

confidence: 99%

The 3D visibility complex : a new approach to the problems of accurate visibility

1996

View full text Add to dashboard Cite

Visibility computations are central in any computer graphics application. The most common way to reduce this expense is the use of approximate approaches using spatial subdivision. More recently analytic approaches efficiently encoding visibility have appeared for 2D (the visibility complex) and for certain limited cases in 3D (aspect graph, discontinuity meshes). In this paper we propose a new way of describing and studying the visibility of 3D space by a dual space of the 3D lines, such that all the visibility events are described. A new data-structure is defined, called the 3D visibility complex, which encapsulates all visibility events. This structure is global and complete since it encodes all visibility relations in 3D, and is spatially coherent allowing efficient visibility queries such as view extraction, aspect graph, discontinuity mesh, or form factor computation. A construction algorithm and suitable data structures are sketched.

show abstract

Fast ray tracing by ray classification

Cited by 90 publications

References 11 publications

Reconstructing the indirect light field for global illumination

Reconstructing the indirect light field for global illumination

Accelerating ray shooting through aggressive 5D visibility preprocessing

The 3D visibility complex : a new approach to the problems of accurate visibility

Contact Info

Product

Resources

About