On ray shooting in convex polytopes
- 160 Downloads
LetP be a convex polytope withn facets in the Euclidean space of a (small) fixed dimensiond. We consider themembership problem forP (given a query point, decide whether it lies inP) and theray shooting problem inP (given a query ray originating insideP, determine the first facet ofP hit by it). It was shown in [AM2] that a data structure for the membership problem satisfying certain mild assumptions can also be used for the ray shooting problem, with a logarithmic overhead in query time. Here we show that some specific data structures for the membership problem can be used for ray shooting in a more direct way, reducing the overhead in the query time and eliminating the use of parametric search.
We also describe an improved static solution for the membership problem, approaching the conjectured lower bounds more tightly.
KeywordsQuery Point Query Time Convex Polytope Membership Problem Partition Tree
- [AM1] P. K. Agarwal and J. Matoušek. Dynamic half-space range reporting and its applications. Technical Report CS-1991-43, Duke University, 1991.Google Scholar
- [AM2] P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. InProc. 24th ACM Symposium on Theory of Computing, pages 517–526, 1992. Full version as Technical Report CS-1991-22, Duke University, 1991.Google Scholar
- [BC] H. Brönnimann and B. Chazelle. How hard is halfspace range searching? InProc. 8th Symposium on Computational Geometry, pages 271–275, 1992.Google Scholar
- [CEGS] B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir. A singly-exponential stratification scheme for real semi-algebraic varieties and its applications. InProc. 16th International Colloquium on Automata, Languages and Programming, pages 179–192. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, Berlin, 1989.CrossRefGoogle Scholar
- [CF] B. Chazelle and J. Friedman. Point location among hyperplanes and vertical ray shooting.Computational Geometry: Theory and Applications (to appear).Google Scholar
- [dBH+] M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld. Efficient ray shooting and hidden surface removal.Algorithmica (to appear).Google Scholar
- [Ma3] J. Matoušek. On vertical ray shooting in arrangements.Computational Geometry: Theory & Applications (to appear).Google Scholar
- [MS] J. Matoušek and O. Schwarzkopf. Linear optimization queries. InProc. 8th ACM Symposium on Computational Geometry, pages 16–25, 1992.Google Scholar
- [Mu] K. Mulmuley. Randomized multidimensional search trees: further results in dynamic sampling. InProc. 32nd Symposium on Foundations of Computer Science, pages 216–227, 1991.Google Scholar