| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414315 | Computational Geometry | 2008 | 9 Pages |
Abstract
We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R3. The data structure uses O(n2+ε) storage and preprocessing time, and queries can be answered in O(log2n) time. A trade-off between storage and query time is also possible: for any m with n
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
