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.
@inproceedings{GuptaJS96:0,
title = {Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons},
author = {Prosenjit Gupta and Ravi Janardan and Michiel H. M. Smid},
year = {1996},
researchr = {https://researchr.org/publication/GuptaJS96%3A0},
cites = {0},
citedby = {0},
pages = {8-13},
booktitle = {Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996},
editor = {Frank Fiala and Evangelos Kranakis and Jörg-Rüdiger Sack},
publisher = {Carleton University Press},
isbn = {0-88629-307-3},
}