Algorithms for ray-shooting and intersection searching
- 31 December 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (4) , 670-692
- https://doi.org/10.1016/0196-6774(92)90062-h
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLSInternational Journal of Computational Geometry & Applications, 1991
- Implicitly representing arrangements of lines or segmentsDiscrete & Computational Geometry, 1989
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniquesPublished by Springer Nature ,1988
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Worst-case optimal insertion and deletion methods for decomposable searching problemsInformation Processing Letters, 1981