Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons

Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid. Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. In Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack, editors, Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996. pages 8-13, Carleton University Press, 1996.

Abstract

Abstract is missing.