Batched dynamic solutions to decomposable searching problems
- 31 December 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (4) , 515-542
- https://doi.org/10.1016/0196-6774(85)90030-6
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- An improved algorithm for the rectangle enclosure problemJournal of Algorithms, 1982
- On the equivalence of some rectangle problemsInformation Processing Letters, 1982
- Polygonal intersection searchingInformation Processing Letters, 1982
- Finding intersection of rectangles by range searchJournal of Algorithms, 1981
- On the intersection of Orthogonal objectsInformation Processing Letters, 1981
- ProblemsJournal of Algorithms, 1981
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Decomposable searching problemsInformation Processing Letters, 1979