Results 111 to 120 of about 132,994 (259)
Encoding Occupancy in Memory Location for Efficient and Compact High‐Resolution Voxel Structures
We encode information about geometric structure into the pointers of a sparse voxel directed acyclic graph (SVDAG). Each pointer carries information about the structure of the node it points to. Our encoding improves ray tracing performance and reduces model size in memory.
Jaina Modisett, Markus Billeter
wiley +1 more source
A Real‐Time Multi‐Scale Neural Representation for Complex Surface Reflectance
Abstract Recent machine learning methods have significantly advanced the state of the art in the classic problem of representing surface appearance over angle, space, and scale. The models tend, however, to be relatively heavy compared to traditional fixed‐function representations, making real‐time application challenging.
Heikki Timonen +2 more
wiley +1 more source
CacheAware: Data Locality-Aware Scheduling for Distributed Memory Systems
The widening performance gap between processor speed and memory access latency has made data locality a critical bottleneck in high-performance computing. In Non-Uniform Memory Access (NUMA) and distributed memory systems, remote accesses incur penalties
Haifa A. Alanazi +2 more
doaj +1 more source
TABI: Tight and Balanced Interactive Atlas Packing
Abstract Atlas packing is a key step in many computer graphics applications. Packing algorithms seek to arrange a set of charts within a fixed‐size atlas with as little downscaling as possible. Many packing applications such as content creation tools, dynamic atlas generation for video games, and texture space shading require on‐the‐fly interactive ...
F. Gu, N. Vining, A. Sheffer
wiley +1 more source
Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann +2 more
wiley +1 more source
Relational database management systems (RDBMS) have long served as the fundamental infrastructure for web applications. Relatively slow access speeds characterize an RDBMS because its data is stored on a disk. This RDBMS weakness can be overcome using an
Mulki Indana Zulfa +4 more
doaj +1 more source
Neural Local Inter‐reflection Modeling for Garment Fold Rendering
Abstract Realistic garment rendering requires simulating complex multi‐bounce light paths within intricate fold geometries. In these regions, conventional path tracing is computationally expensive as light becomes trapped, necessitating high bounce counts for convergence.
Jooeun Son +4 more
wiley +1 more source
Real‐time by‐example texture synthesis and filtering using local statistics exchange
Abstract Real‐time by‐example texture synthesis is used in interactive virtual worlds to generate the appearance of an unbounded surface from an exemplar texture with as few repetitions as possible. Currently, leading real‐time methods rely on a tiling and blending scheme which is known to synthesize well texture patterns with little spatial ...
Nicolas Lutz, Guillaume Gilet
wiley +1 more source
Real‐Time Rendering of Dynamic Line Sets using Voxel Ray Tracing
Abstract Real‐time rendering of dynamic line sets is relevant in many visualization tasks, including unsteady flow visualization and interactive white matter reconstruction from Magnetic Resonance Imaging. High‐quality global illumination and transparency are important for conveying the spatial structure of dense line sets, yet remain difficult to ...
B. Kraaijeveld +3 more
wiley +1 more source
Stochastic Pairwise MIS for Unbiased Large‐Kernel Reuse in Real‐Time
Abstract Spatiotemporal resampling methods such as ReSTIR decrease noise in Monte Carlo rendering of dynamic content by reusing paths across frames and pixels. Standard ReSTIR reuses spatially from a small number of randomly selected neighbors. This reuse suffers when few neighbors contain contributing samples, reducing quality toward that of the ...
Trevor Hedstrom +4 more
wiley +1 more source

