Author:
Chan Timothy M.,Nekrich Yakov,Smid Michiel
Publisher
Springer International Publishing
Reference26 articles.
1. Lecture Notes in Computer Science;P Afshani,2008
2. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science, (FOCS 2000), pp. 198–207 (2000)
3. Arge, L., Samoladas, V., Vitter, J.S.: On two-dimensional indexability and optimal range search indexing. In: Proceedings of 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 346–357 (1999)
4. Aronov, B., de Berg, M., Gray, C.: Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1–2), 68–76 (2008)
5. Bentley, J.L., Maurer, H.A.: Efficient worst-case data structures for range searching. Acta Inf. 13, 155–168 (1980)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献