Author:
Andersson Mattias,Gudmundsson Joachim,Levcopoulos Christos
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference25 articles.
1. Fast estimation of diameter and shortest paths (without matrix multiplication);Aingworth;SIAM Journal on Computing,1999
2. S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, C.D. Zaroliagis, Planar spanners and approximate shortest path queries among obstacles in the plane, in: Proc. 4th European Symposium on Algorithms, 1996, pp. 514–528
3. An optimal algorithm for approximate nearest neighbor searching;Arya;Journal of the ACM,1998
4. S. Baswana, S. Sen, Approximate distance oracles for unweighted graphs in O(n2logn) time, in: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 271–280
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
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献