Introduction
Traditional computer graphics typically operate under the assumption of Euclidean geometry, where light travels along perfectly straight lines. However, simulating phenomena such as gravitational lensing, atmospheric mirages, or stylized spatial warps requires a shift to non-Euclidean frameworks. In these spaces, light follows geodesics—paths of shortest distance governed by the underlying Riemannian metric. This paper introduces a novel framework for real-time ray tracing in such spaces by constructing custom Riemannian metrics within $\mathbb{R}^3$.
Methodology: Real-Time Geodesic Ray Tracing
The core challenge in non-Euclidean rendering is the computational cost of calculating geodesics. The authors formulate ray tracing as solving the geodesic flow on a manifold. Instead of a single straight vector, rays are modeled as polygonal chains integrated step-by-step using numerical methods.
To make this interactive, the paper proposes two tractable methods for metric design:
- Graphs of Functions: By treating 3D space as a pullback of a 4D graph $w = f(x,y,z)$, the authors derive explicit formulas for Christoffel symbols using only the gradient and Hessian of $f$.
- Diffeomorphisms: Using a smooth mapping $\Phi$, the authors present a novel mathematical proof (Theorem 5.1) that provides a direct way to compute Christoffel symbols from the Jacobian and Hessian of $\Phi$, bypassing complex tensor calculus.
These deformations are compositional, allowing for the creation of complex environments by summing functions (e.g., multiple Gaussian "bumps") or composing mappings using the chain rule.
Visualization and Results
The framework was evaluated using procedurally generated 3D grids to visualize the effects of various spatial deformations. By leveraging the simplified mathematical formulations and GPU-accelerated numerical integration via Euler's method, the authors achieved real-time performance on modern Nvidia RTX hardware.
The results demonstrate that ray tracing is uniquely suited for these geometries. In certain curved spaces, multiple light paths can connect the same two points—a condition where traditional rasterization fails due to the non-injective nature of the exponential map.
Discussion and Future Work
A significant contribution of this work is the simplification of the mathematical pipeline for GPU implementation. Theorem 5.1, in particular, enables technical artists to program complex deformations without deep expertise in differential geometry.
However, limitations remain. The current ray-scene intersection test is performed sequentially for each segment of the curved ray, which is inefficient. Future optimizations could involve parallelizing these tests to better utilize GPU hardware. Additionally, while the Euler method provides the speed necessary for real-time interaction, higher-order integration methods like Runge-Kutta could improve accuracy over long distances where integration drift might occur.
Summary updated