On ray shooting in convex polytopes
- 1 July 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 215-232
- https://doi.org/10.1007/bf02573975
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- How hard is halfspace range searching?Published by Association for Computing Machinery (ACM) ,1992
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- A singly-exponential stratification scheme for real semi-algebraic varieties and its applicationsPublished by Springer Nature ,1989
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- How to search in historyInformation and Control, 1985
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980