Linear space data structures for two types of range search
- 1 June 1987
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 2 (2) , 113-126
- https://doi.org/10.1007/bf02187875
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Priority Search TreesSIAM Journal on Computing, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Optimal solutions for a class of point retrieval problemsJournal of Symbolic Computation, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Polygon RetrievalSIAM Journal on Computing, 1982
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975