Polygonal intersection searching
- 1 April 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 14 (2), 74-79
- https://doi.org/10.1016/0020-0190(82)90090-4
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A space-optimal solution of general region locationTheoretical Computer Science, 1981
- Comments on “algorithms for reporting and counting geometric intersections”IEEE Transactions on Computers, 1981
- The rectangle intersection problem revisitedBIT Numerical Mathematics, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976