Halfplanar range search in linear space and O(n0.695) query time
- 1 November 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (5) , 289-293
- https://doi.org/10.1016/0020-0190(86)90088-8
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Constructing Belts in Two-Dimensional Arrangements with ApplicationsSIAM Journal on Computing, 1986
- Partitioning with two lines in the planeJournal of Algorithms, 1985
- Polygonal intersection searchingInformation Processing Letters, 1982
- Polygon RetrievalSIAM Journal on Computing, 1982
- Neighbor finding techniques for images represented by quadtreesComputer Graphics and Image Processing, 1982
- Worst-case optimal insertion and deletion methods for decomposable searching problemsInformation Processing Letters, 1981
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974