Epsilon-nets and simplex range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Efficiently computing the closest point to a query line
Pattern Recognition Letters
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Using simplicial partitions to determine a closest point to a query line
Pattern Recognition Letters
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Ray shooting amid balls, farthest point from a line, and range emptiness searching
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Computing a closest point to a query hyperplane in three and higher dimensions
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Proceedings of the twenty-sixth annual symposium on Computational geometry
| Hi-index | 0.00 |
The problem of finding a nearest neighbor from a set of points in ℝd to a complex query object has attracted considerable attention due to various applications in computational geometry, bio-informatics, information retrieval, etc. We propose a generic method that solves the problem for various classes of query objects and distance functions in a unified way. Moreover, for linear space requirements the method simplifies the known approach based on ray-shooting in the lower envelope of an arrangement.