Ray tracing is an inherent part of photorealistic image synthesis algorithms. The problem of
ray tracing is to find the nearest intersection with a given ray and scene. Although this …

We propose a novel GPU-oriented approach for constructing binary bounding volume
hierarchies (BVHs) based on the parallel locally-ordered clustering (PLOC/PLOC++) …

We propose a novel version of the GPU-oriented massively parallel locally-ordered
clustering (PLOC) algorithm for constructing bounding volume hierarchies (BVHs). Our …

Ray tracing is an inherent component of modern rendering algorithms. The bounding
volume hierarchy (BVH) is a commonly used acceleration data structure employed in most …

Spatial data structures, such as kd trees and bounding volume hierarchies, are extensively
used in computer graphics for the acceleration of spatial queries in ray tracing, nearest …

A novel bounding volume hierarchy (BVH) construction method based on locally dense
clustering (LDC) was proposed for the low quality of BVH constructed in a complex scene …

We propose an unconventional solution to high-performance ray tracing that combines a ray
ordering scheme that minimizes access to the scene data with a large on-chip buffer acting …

Data movement, particularly access to the main memory, has been the bottleneck of most
computing problems. Ray tracing is no exception. We propose an unconventional solution …

BVH construction is a critical component of real‐time and interactive ray‐tracing systems.
However, BVH construction can be both compute and bandwidth intensive, especially when …

R-tree is an important multi-dimensional data structure widely employed in many
applications for storing and querying spatial data. As GPUs emerge as powerful computing …