Abstract
Space-efficient algorithms are presented for some geometric intersection searching problems such as ray-shooting, segment intersection searching, and triangle stabbing. The algorithms for ray-shooting and segment intersection searching improve upon the algorithms given previously. These algorithms also have significantly lower query times than the algorithms previously presented, but the space is larger by a low-degree polylog factor. Efficient dynamic algorithms are also presented for the above problems and for triangle range searching by taking advantage of their decomposability.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 670-692 |
| Number of pages | 23 |
| Journal | Journal of Algorithms |
| Volume | 13 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1992 |
Bibliographical note
Funding Information:*Research partly supported by a grant-in-aid of research from the Graduate School of the University of Minnesota. The second author was also supported in part by NSF Grant CCR-8808574.