Ray shooting and parametric search

We consider the problem of ray shooting in a three-dimensional scene consisting of $m$ (possibly intersecting) convex polyhedra or polyhedral terrains with a total of $n$ faces, i.e., we want to preprocess them into a data structure, so that the first ...

We consider the problem of ray shooting amidst spheres in 3-space: given n arbitrary (possibly intersecting) spheres in 3-space and any $\epsilon$ > 0, we show how to preprocess the spheres in time $O(n^{3+\epsilon})$ into a data structure of size $O(n^{...

Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applications, e.g., radio propagation simulation. Aronov and Fortune were the ...