This paper reviews the basic concepts of rays, ray tracing algorithms, and radio propagation
modeling using ray tracing methods. We focus on the fundamental concepts and the …

Ray tracing has long been a method of choice for off‐line rendering, but traditionally was too
slow for interactive use. With faster hardware and algorithmic improvements this has recently …

Abstract The k-Nearest Neighbor (k NN) algorithm is widely used in the supervised learning
field and, particularly, in search and classification tasks, owing to its simplicity, competitive …

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 present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-
time performance by exploiting the GPU's streaming architecture at all stages of kd-tree …

We present two novel parallel algorithms for rapidly constructing bounding volume
hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton …

The most significant deficiency of most of today's interactive ray tracers is that they are
restricted to static walkthroughs. This restriction is due to the static nature of the acceleration …

In this article, we propose a novel entropy and confidence-based undersampling boosting
(ECUBoost) framework to solve imbalanced problems. The boosting-based ensemble is …

With ray traversal performance reaching the point where real-time ray tracing becomes
practical, ray tracing research is now shifting away from faster traversal, and towards the …

The original description of the kd tree recognized that rebalancing techniques, such as are
used to build an AVL tree or a red-black tree, are not applicable to a kd tree. Hence, in order …