Author:
Arikati Srinivasa,Chen Danny Z.,Chew L. Paul,Das Gautam,Smid Michiel,Zaroliagis Christos D.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. S. Arya, G. Das, D.M. Mount, J.S. Salowe and M. Smid, “Euclidean spanners: short, thin, and lanky”, Proc. 27th ACM STOC, 1995, pp. 489–498.
2. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman and A. Wu, “An optimal algorithm for approximate nearest neighbor searching”, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 573–582.
3. M. J. Atallah and D. Z. Chen, “Parallel rectilinear shortest paths with rectangular obstacles”, Comp. Geometry: Theory and Appl., 1:2 (1991), pp.79–113.
4. M. J. Atallah and D. Z. Chen, “On parallel rectilinear obstacle-avoiding paths”, Computational Geometry: Theory and Applications, 3 (1993), pp. 307–313.
5. D. Z. Chen. “On the all-pairs Euclidean short path problem”, Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 1995, pp. 292–301.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献