Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.16180

Delayed-Light Rendering for Superluminal Objects

David Bizzozero
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a real-time rendering method for scenes perceived through signals of finite speed $c$ in a non-relativistic setting: $c$ is a property of the imaging signal, not the causal speed limit, so bodies may move faster than $c$. A superluminal body presents several simultaneous images; pairs are created and annihilated in caustic flashes, and some branches play backward in time. Rather than approximating these effects, we enumerate them as roots of an emission condition posed against recorded state history, exact at every point solved, up to one stated approximation for moving observers. Because a fixed-step simulation records piecewise-linear history, the emission condition restricted to one history segment is a quadratic whose discriminant detects image-pair creation and whose slope classifies each image's playback direction, rate, and brightness. Perception is not tied to a single reference point: a global perceived state is built for an arbitrary finite set of observation events, and the delay landscape is the upper envelope of their backward light cones. A monotonic emission clamp guarantees the picture never regresses to images older than those already shown. Per-vertex solves shear bodies straddling delay gradients, and pre-generated frame-sequence assets are adapted by treating them as $(x,y,t)$ volumes sliced by the solved emission surface, so playback rate, reversal, and intra-body de-phasing arise with no animation-specific code. The exposition and implementations are planar: the emission condition and its per-segment solve are norm conditions, independent of dimension, but the visibility and occlusion questions a 3D renderer must answer are out of scope. The method is deployed in a released real-time strategy game; we describe the optimizations that make it run at interactive rates, and measure the algorithms through independent reference implementations.

Explore related subjects

cs.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Bizzozero. 2026-09-14. Delayed-Light Rendering for Superluminal Objects. https://arxiv.org/abs/2609.16180

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

IKMo: Image-Keyframed Motion Generation with Trajectory-Pose Conditioned Motion Diffusion Model

While text-to-motion generation is mainstream, integrating explicit spatial constraints has become a standard solution for precise animation. Existing state-of-the-art models are tailored for professional workflows, effectively processing high-quality, pre-aligned 3D inputs via unified conditioning mechanisms. However, this strictly aligned setting restricts accessibility for general users who rely on unaligned, in-the-wild 2D reference images. This accessible scenario introduces a fundamental conflict: heterogeneous geometric constraints, where user-defined global trajectories clash with local image-derived poses. To resolve this coordinate mismatch, we propose TPMDM, a diffusion model featuring a decoupled parallel control strategy that explicitly isolates and aligns these divergent signals. Furthermore, we introduce IKMo, a holistic framework that synergizes TPMDM with a VLM-powered multi-agent system. By bridging the semantic-geometric gap, IKMo translates user-friendly inputs into explicit motion constraints to drive the diffusion backbone. Experiments on HumanML3D and KIT-ML demonstrate that our method establishes a new state-of-the-art in the task of generating motions under heterogeneous trajectory and keyframe pose constraints.

cs.GR↗
arXiv2026

ResStreamGS: Residual-Sensitive Dual-Stream Gaussian Splatting for Mobile Volumetric Video Streaming

Real-time mobile volumetric video enables immersive free-viewpoint experiences, but delivering high-quality 3D content under constrained bandwidth and computation remains challenging. Recent 3D Gaussian Splatting (3DGS) systems, such as V$^3$, enable efficient mobile streaming by encoding time-varying Gaussian attributes with commodity video codecs and hardware decoding. However, existing pipelines treat all Gaussians as frame-varying signals, which is poorly suited to full-scene content where large portions remain temporally stable. Our empirical study shows that frame-wise adaptation and video coding of all Gaussians cause quality degradation in complex full-scene content, particularly in temporally stable regions. To address this issue, we propose ResStreamGS, a residual-sensitive dual-stream framework that processes Gaussians according to their temporal behavior. ResStreamGS identifies residual-sensitive primitives through lightweight probe adaptation and reuses stable Gaussians within each Group of Pictures (GOP). Stable Gaussians are transmitted once per GOP, while only residual-sensitive Gaussians remain in the frame-wise hardware-decodable video stream. Experiments on complex full-scene volumetric videos show that ResStreamGS improves post-codec PSNR by 7.51--8.35~dB over a controlled V$^3$-style all-Gaussians baseline, reduces amortized payload by up to 56.5%, and achieves 30.883~FPS on a Qualcomm Snapdragon 778G platform.

cs.GR↗
arXiv2026

Geometric Queries on Tessellation-Free Displaced Surfaces

Displacement maps encode fine geometric detail in compact textures and simplify surface authoring, but using them typically requires pre-tessellating surfaces into dense triangle meshes, incurring a heavy memory cost. Recent tessellation-free methods enable direct ray tracing. However, broader geometric queries such as surface sampling, specular manifold search, and closest-point queries remain less explored. Supporting these operations requires surface enclosures, area estimates, and normal bounds, which scalar height intervals alone do not fully provide. We present a first-order texture-space hierarchy that unlocks these queries directly without pre-tessellation. Each node stores a local affine height plane and a conservative residual bound, retaining spatial height variation that scalar minimum--maximum bounds discard. The plane and residual provide surface enclosures for intersection and distance searches, while the plane's height and slopes supply area estimates for sampling. Additional slope bounds support specular light-path search. Building on this representation, we develop query-specific traversal, pruning, and sampling algorithms, and demonstrate them in caustics rendering, sampling displaced emitters, and surface partial differential equation (PDE) solvers. We demonstrate memory savings over pre-tessellation and performance improvements over query-specific baselines, while retaining efficient ray tracing.

cs.GR↗