Efficient Searching with Linear Constraints
- 1 October 2000
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 61 (2) , 194-216
- https://doi.org/10.1006/jcss.2000.1709
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Optimal dynamic interval management in external memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Geometric range searching and its relativesPublished by American Mathematical Society (AMS) ,1999
- Efficient searching with linear constraintsPublished by Association for Computing Machinery (ACM) ,1998
- On Levels in Arrangements of Lines, Segments, Planes, and Triangles%Discrete & Computational Geometry, 1998
- External-memory algorithms for processing line segments in geographic information systemsPublished by Springer Nature ,1995
- Intersection Queries in Curved ObjectsJournal of Algorithms, 1993
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Organization and maintenance of large ordered indexesActa Informatica, 1972