Publisher
Springer Berlin Heidelberg
Reference70 articles.
1. Afshani, P., Arge, L., Larsen, K.D.: Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. In: Proceedings of the 26th Annual ACM Symposium on Computational Geometry, pp. 240–246 (2010)
2. Afshani, P., Arge, L., Larsen, K.G.: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. In: Proceedings of the 28th Annual ACM Symposium on Computational Geometry, pp. 323–332 (2012)
3. Aleksandrov, L., Djidjev, H.: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM Journal on Discrete Mathematics 9(1), 129–150 (1996)
4. Lecture Notes in Computer Science;L.G. Aleksandrov,2000
5. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 198–207 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献