Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection-Reference-Cited by-同舟云学术

Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection

Published:1991-12 Issue:4 Volume:31 Page:558-565
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Bartling Frank,Hinrichs Klaus

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01933171.pdf

Reference8 articles.

1. J. H. Friedman, F. Baskett and L. J. Shustek,An algorithm for finding nearest neighbors, IEEE Transactions on Computers C-24, 10, 1000–1006, October 1975.

2. M. Golin,Probabilistic analysis of geometric algorithms, Ph.D. thesis, Princeton University, Department of Computer Science, CS-TR-266-90, June 1990.

3. K. Hinrichs, J. Nievergelt and P. Schorn,Plane-sweep solves the closest pair problem elegantly, Information Processing Letters 26 (1988), 255–261.

4. K. Hinrichs, J. Nievergelt and P. Schorn,An allround sweep algorithm for 2-dimensional nearest-neighbor problems, Proc. of the Second Canadian Conference in Computational Geometry, University of Ottawa (1990), 343–346.

5. E. Kaufmann and R.-D. Reiss,On conditional distributions of nearest neighbors, Mathematischer Forschungsbericht 244/1990, Universität-GH-Siegen.

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

1. Closest-Point Problems in Computational Geometry;Handbook of Computational Geometry;2000

2. Incremental distance join algorithms for spatial databases;ACM SIGMOD Record;1998-06