Orders, k-sets and fast halfplane search on paged memory
- 22 November 2005
- book chapter
- Published by Springer Nature
- p. 117-127
- https://doi.org/10.1007/bfb0019430
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- How hard is half-space range searching?Discrete & Computational Geometry, 1993
- Reporting points in halfspacesComputational Geometry, 1992
- On locally presented posetsTheoretical Computer Science, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Dissection Graphs of Planar Point SetsPublished by Elsevier ,1973
- Partially Ordered SetsAmerican Journal of Mathematics, 1941