Ray Tracing (Graphics)¶

Synthesize image samples by launching geometric rays through a scene, ordering their intersections, and evaluating visibility and light transport as paths reflect, refract, scatter, or terminate.

Version: v2 · 2026-09-06 · History
Domain-specific #: 2627
Origin domain: computer science
Subdomain: computer graphics
Aliases: Graphics ray tracing, Ray-traced rendering, Ray tracing rendering

Core Idea¶

Ray tracing in computer graphics constructs an image by following idealized geometric rays through a scene model. A camera ray associated with an image sample is intersected against scene geometry; the nearest valid interaction determines visibility. The renderer then evaluates emitted or reflected light and may create shadow, reflection, refraction, or scattering rays. Whitted's recursive formulation made reflection, refraction, and shadow visibility part of one coherent image-synthesis procedure.^[1]

Modern ray-tracing families differ in how paths are generated and how the rendering equation is estimated, but they retain the same computational core: propagate rays, find interactions, evaluate transport, and accumulate a sample value.

Structural Signature¶

A camera or sensor model and an image-sample domain.
A three-dimensional scene with geometric primitives or procedural geometry.
Rays with origin, direction, and a valid parameter interval.
A ray-generation rule connecting image samples to the scene.
A nearest-intersection query over candidate primitives.
Surface or volume interaction records.
Material and scattering models at interactions.
Light sources or emitted radiance.
Visibility tests between interactions and emitters.
Continuation rules for reflection, transmission, or scattering.
Termination rules limiting path depth or contribution.
An estimator or deterministic evaluation rule for pixel contribution.
Acceleration structures that prune intersection work.
Sampling and reconstruction rules when multiple samples contribute to one pixel.

What It Is Not¶

It is not rasterization, which projects and scan-converts primitives rather than querying the scene along independent rays. It is not ray casting alone when only the first visible intersection is evaluated without recursive or transport continuation. It is not photon mapping, although photon maps may be queried by a ray-based renderer. It is not physical optics: standard graphics rays usually omit phase, diffraction, and interference.

Scope of Application¶

Ray tracing supports offline visual effects, architectural visualization, product rendering, scientific visualization, and increasingly real-time hybrid graphics. The same intersection machinery underlies primary visibility, shadow queries, reflections, refractions, ambient occlusion, and Monte Carlo path tracing. Kajiya's rendering equation provides the light-transport relation whose numerical estimators organize modern physically based rendering.^[2]

Clarity¶

State whether “ray tracing” means first-hit ray casting, recursive Whitted tracing, distribution ray tracing, path tracing, or a hybrid pipeline. Declare the ray direction convention, visibility semantics, scattering model, estimator, sample count, termination policy, and whether participating media are included. “Real-time ray tracing” describes a performance regime, not a different identity.

Manages Complexity¶

Rays turn global visibility and transport into repeated local queries: generate, intersect, shade, continue. Spatial acceleration structures such as bounding-volume hierarchies reduce the geometry search, while sampling decomposes a high-dimensional transport integral into path contributions. The method can trade computation for fidelity without changing its basic interface.

Abstract Reasoning¶

Generate one or more camera rays for an image sample.
Intersect each ray with the scene and select the nearest admissible hit.
Return background or environment emission if no hit exists.
At a hit, evaluate emitted light, geometry, and material response.
Test visibility to sampled light sources when using direct-light estimates.
Generate continuation rays according to reflection, refraction, or scattering.
Weight and accumulate path contributions.
Terminate by depth, contribution, or unbiased stochastic policy.
Reconstruct the pixel from its samples and quantify residual variance or bias.

Physically based implementations make these steps explicit in a modular rendering architecture.^[3]

Knowledge Transfer¶

The portable pattern is answer a global field-of-view question by launching local probes from the query point, following each probe through ordered boundary interactions, and accumulating what returns. The proposed immediate parent is Propagation.

Examples¶

A primary ray hits a mirror; a reflected ray hits a colored wall; a shadow ray checks whether the wall is visible to a lamp. Their weighted contributions determine the pixel. In path tracing, random directions sample possible light paths and many noisy samples converge toward the transport integral.

Appel's early algorithm used rays for visibility and shadow determination, establishing the computational lineage before fully recursive shading.^[4]

Structural Tensions¶

Visual fidelity versus computation time.
Deterministic paths versus stochastic estimators.
Unbiased estimation versus variance.
Exact geometry versus numerical robustness.
Deep transport paths versus termination cost.
General path queries versus specialized raster hardware.

Structural–Framed Character¶

Probe propagation is structural. Cameras, rays, scene primitives, intersection ordering, radiance, scattering, and pixels are constitutive to the graphics technique. The abstraction is domain-specific.

Structural Core vs. Domain Accent¶

The structural core is launch probe -> find nearest interaction -> update direction and weight -> accumulate returned contribution. The domain accent is geometric-optics image synthesis.

Propagation is the proposed immediate parent. Perspective, Representation, Transformation, Monte Carlo Simulation, Approximation, and Decomposition are related primes.

The prospective queue contains one strict edge to prime:propagation. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Ray Tracing (Graphics) Domain-specific

Parents (1) — more general patterns this builds on

Ray Tracing (Graphics) is a kind of Propagation Prime

Propagation is the proposed immediate parent.

Hierarchy path (1) — routes to 1 parentless root

Ray Tracing (Graphics) → Propagation

Neighborhood in Abstraction Space¶

Ray Tracing (Graphics) sits in a sparse region of the domain-specific corpus (93^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Rasterization.
First-hit ray casting treated as all ray tracing.
Path tracing treated as a synonym for every ray-tracing method.
Photon mapping.
Hardware “RTX” branding.
Wave-optics simulation that models phase and diffraction.

References¶

[1] Turner Whitted, “An Improved Illumination Model for Shaded Display,” Communications of the ACM 23, no. 6 (1980): 343–349, doi:10.1145/358876.358882. registry ↩

[2] James T. Kajiya, “The Rendering Equation,” Computer Graphics 20, no. 4 (1986): 143–150, doi:10.1145/15922.15902. registry ↩

[3] Matt Pharr, Wenzel Jakob, and Greg Humphreys, Physically Based Rendering: From Theory to Implementation, 4^th ed. (MIT Press, 2023), ISBN 978-0-262-04802-6. registry ↩

[4] Arthur Appel, “Some Techniques for Shading Machine Renderings of Solids,” Proceedings of the Spring Joint Computer Conference (1968): 37–45, doi:10.1145/1468075.1468082. registry ↩