Rectilinear line segment intersection, layered segment trees, and dynamization
- 30 June 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (2) , 160-176
- https://doi.org/10.1016/0196-6774(82)90016-5
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Counting and Reporting Intersections of d-RangesIEEE Transactions on Computers, 1982
- Computing Point EnclosuresIEEE Transactions on Computers, 1982
- Two general methods for dynamizing decomposable searching problemsComputing, 1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Dynamization of decomposable searching problemsInformation Processing Letters, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Decomposable searching problemsInformation Processing Letters, 1979