Gupta, Prosenjit Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Smid, Michiel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Gupta, P., Janardan, R., & Smid, M. (1999). Efficient algorithms for counting and reporting pairwise intersections between convex polygons. Information Processing Letters, 69(1), 7-13.