1. Benouamer, M.O., Jaillon, P., Michelucci, D. and Moreau, J.M., “A Lazy Solution to Imprecision in Computational Geometry,” Proceedings of the Fifth Canadian Conference on Computational Geometry, 1993, pp. 73–78.
2. Bentley, J.L. and Ottmann, T.A., “Algorithms for Reporting and Counting Geometric Intersections,” IEEE Transactions on Computer, Vol. c-28 (1979), pp. 643–647.
3. Chan, E.P.F. and Zhu, R., “QL/G: A Query Language for Geometric Databases,” Proceedings of the First International Conference on GIS in Urban and Environmental Planning, Island of Samos, Greece, April 1996, pp. 271–286.
4. Chazelle. B. and Edelsbrunner, H., “An Optimal Algorithm for Intersecting Line Segments in the Plane,” JACM 39:1, January 1992, pp. 1–54.
5. DeWitt, D., Kabra, N., Luo, J., Patel, J.M., Yu, J.B., “Client-Server Paradise,” Proceedings of the 20th International Conference on VLDB, Santiago, Chile, 1994.