Edelsbrunner, H. “A New Approach to Rectangle Intersections Part I”, International Journal of Computer Mathematics, vol. 13, 1983. pp. 209-219.* |
Edelsbrunner, H., and M.H. Overmars, “Batched Dynamic Solutions to Decomposable Search Problems”, Journal of Algorithms, vol. 6, No. 4, Dec. 1985, pp. 515-542.* |
Aggarwal, Alok, and Jeffrey Scott Vitter, “The Input/Output Complexity of Sorting and Related Problems”, Communications of the ACM, vol. 31, No. 9, Sep. 1988, pp. 1116-1127.* |
Goodrich, M.T., J-J Tsay, D.E. Vengroff and J.S. Vitter. “External-Memory Computational Geometry”, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, Nov. 3-5, 1993. pp. 714-723.* |
Patel, J.M. and D.J. DeWitt. “Partition Based Spatial-Merge Join (Extended Version)”, found at http://www.cs.wisc.edu/paradise/papers/extended.spjoin.ps.* |
Arge, Lars, and Jeffrey Scott Vitter “Optimal Dynamic Interval Management in External Memory”: Proc. of the 37th Annual Symposium on Foundations of Computer Science, pp. 560-569. 1996.* |
Koudas, N. and K.C. Sevcik. “High Dimensional Similarity Joins: Algorithms and Performance Evaluation”, Proceedings of the 14th International Conference on Data Engineering, Feb. 23-27, 1998. pp. 466-475.* |
Gaede, Volker, and Oliver Gunther, “Multidimensional Access Methods”, ACM Computing Surveys, vol. 30, No. 2, Jun. 1998, pp. 170-231.* |
Arge, Lars et al. “Theory and Practice of I/O Efficient Algorithms for Multidimensional Batched Searching Problems”: Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 685-694. Jan. 17-19, 1999. |