Efficient dynamic algorithms for some geometric intersection problems
- 1 December 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (5) , 251-258
- https://doi.org/10.1016/0020-0190(90)90151-m
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- New results on dynamic planar point locationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamic orthogonal segment intersection searchJournal of Algorithms, 1987
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Adding range restriction capability to dynamic data structuresJournal of the ACM, 1985
- Priority Search TreesSIAM Journal on Computing, 1985
- Rectilinear line segment intersection, layered segment trees, and dynamizationJournal of Algorithms, 1982
- On the intersection of Orthogonal objectsInformation Processing Letters, 1981
- Worst-case optimal insertion and deletion methods for decomposable searching problemsInformation Processing Letters, 1981
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973