Finding intersection of rectangles by range search
- 31 December 1981
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 2 (4), 337-347
- https://doi.org/10.1016/0196-6774(81)90033-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Quintary treesACM Transactions on Database Systems, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973