Loading...
Please wait, while we are loading the content...
Similar Documents
Ray shooting amidst fat convex polyhedra in 3-space
| Content Provider | Semantic Scholar |
|---|---|
| Author | Aronov, Boris Berg, D. Gray, Chris |
| Copyright Year | 2006 |
| Abstract | We present a data structure for ray-shooting queries in a set of disjoint convex fat polyhedra of total complexity n in R 3 . The data structure uses O(n 2+" ) storage and preprocessing time, and queries can be answered in O(log 2 n) time. A trade-off between storage and query time is also possible: for any m with n < m < n 2 , we can construct a structure that uses O(m 1+" ) storage and preprocessing time such that queries take O((n/ p m)log 2 n) time. |
| Starting Page | 21 |
| Ending Page | 24 |
| Page Count | 4 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://delaunay.tem.uoc.gr/~mkaravel/ewcg06/papers/05.pdf |
| Alternate Webpage(s) | http://eurocg.org/06/delaunay.tem.uoc.gr/~mkaravel/ewcg06/papers/05.pdf |
| Alternate Webpage(s) | http://www.win.tue.nl/~cgray/fat-object-ray-shooting-arbitrary.pdf |
| Alternate Webpage(s) | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.1941&rep=rep1&type=pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |