Approximate range searching☆☆A preliminary version of this paper appeared in the Proc. of the 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 172

Approximate range searching☆☆A preliminary version of this paper appeared in the Proc. of the 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 172–181.

Published:2000-12 Issue:3-4 Volume:17 Page:135-152
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Arya Sunil,Mount David M.

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference16 articles.

1. An optimal algorithm for approximate nearest neighbor searching;Arya;Journal of the ACM,1998

2. K-d trees for semidynamic point sets;Bentley,1990

3. Approximate closest-point queries in high dimensions;Bern;Inform. Process. Lett.,1993

4. How hard is halfspace range searching;Brönnimann;Discrete Comput. Geom.,1993

5. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields;Callahan;Journal of the ACM,1995

Cited by 67 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Half-plane point retrieval queries with independent and dependent geometric uncertainties;Computational Geometry;2023-12

2. FRACTIONATION USING K MEANS CLUSTERING;international journal of engineering technology and management sciences;2023

3. Weiterführende Ergebnisse;Algorithmische Geometrie;2022

4. On β-Plurality Points in Spatial Voting Games;ACM Transactions on Algorithms;2021-08

5. Range searching in multidimensional databases using navigation metadata;Applied Mathematics and Computation;2020-12