1. P. Agarwal. Private communication. 1999.
2. D. Andrews, J. Snoeyink, J. Boritz, T. Chan, G. Denham, J. Harrison, and C. Zhu. Further comparison of algorithms for geometric intersection problems. In T. Waugh and R. Healey, editors, Advances in GIS Research ‐ Proceedings of the 6th International Symposium on Spatial Data Handling (SDH’94), volume 2, 709–724, 1994.
3. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. Vitter. Scalable sweepingbased spatial join. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB’98: Proceedings of the 24th International Conference on Very Large Data Bases, 570–581. Morgan Kaufmann, 1998.
4. I. Balaban. An optimal algorithm for finding segment intersections. In Proceedings of the 11th Annual ACM Symposium on Computational Geometry, 211–219, 1995.
5. U. Bartuschka, K. Mehlhorn, and S. Näher. A robust and eficient implementation of a sweep line algorithm for the straight line segment intersection problem. Online-Proccedings of the First Workshop on Algorithm Engineering < http://www.dsi.unive.it/~wae97/proceeedings/ONLY_PAPERS/pap13.ps.gz >, accessed 7 Jul. 1998, 1997.