Gupta, Prosenjit Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Smid, Michiel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
1996-1-008 (beliebiger Volltext), 10KB
Gupta, P., Janardan, R., & Smid, M.(1996). Efficient algorithms for counting and reporting pairwise intersections between convex polygons (MPI-I-1996-1-008). Saarbrücken: Max-Planck-Institut für Informatik.
