Halfspace range search: An algorithmic application ofk-sets
- 1 March 1986
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 1 (1), 83-93
- https://doi.org/10.1007/bf02187685
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On k-hulls and related problemsPublished by Association for Computing Machinery (ACM) ,1984
- Geometric retrieval problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Filtering search: A new approach to query-answeringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- The power of geometric dualityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Constructing arrangements of lines and hyperplanes with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- On k-Nearest Neighbor Voronoi Diagrams in the PlaneIEEE Transactions on Computers, 1982
- Decomposable searching problemsInformation Processing Letters, 1979
- Dissection Graphs of Planar Point SetsPublished by Elsevier ,1973