Ray shooting amidst spheres in three dimensions and related problems.
We consider the problem of ray shooting amidst spheres in 3-space: given n arbitrary (possibly intersecting) spheres in 3-space and any e > 0, we show how to preprocess the spheres in time O (n3+e) into a data structure of size O(n3+e) so that any ray-shooting query can be answered in time O (ne)...
Published in: | SIAM journal on computing. 26, 3 (1997). |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: |