1. Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Handbook of Computation Geometry, pp. 829–876. Elsevier Science Publishers, Amsterdam (2000)
2. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD Conf., Atlantic City, NJ, USA, pp. 322–331. ACM Press, New York (1990), doi:10.1145/93597.98741
3. Bentley, J.L.: Multidimensional binary search trees used for associative searching. CACM 18(9), 509–517 (1975)
4. Lecture Notes in Computer Science;H. Ferhatosmanoglu,2001
5. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD Conf., Boston, MA, USA, pp. 47–57. ACM Press, New York (1984), doi:10.1145/602259.602266