Your search returned the following 9 documents:

9. Efficient algorithms for counting and reporting pairwise intersections between convex polygons
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   Information Processing Letters 69 (1): 7-13, 1999
   
8. The rectangle enclosure and point-dominance problems revisited
   Prosenjit Gupta, Ravi Janardan, Michiel Smid, and Bhaskar Dasgupta
   International Journal of Computational Geometry and Applications 7 (5): 437-456, 1997
   
7. Algorithms for generalized halfspace range searching and other intersection searching problems
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   Computational Geometry 5 (6): 321-340, 1996
   
6. Algorithms for generalized halfspace range searching and other intersection searching problems
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   Computational Geometry 6 (1): 1-19, 1996
   
5. Fast algorithms for collision and proximity problems involving moving geometric objects
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   Computational Geometry 6: 371-391, 1996
   
4. Further results on generalized intersection searching problems: counting, reporting, and dynamization
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   Journal of Algorithms 19 (2): 282-317, 1995
   
3. On the width and roundness of a set of points in the plane
   Ravi Janardan and Michiel Smid
   In: 7th Canadian Conference on Computational Geometry, 1995, 193-198
   
2. The rectangle enclosure and point-dominance problems revisited
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   In: 11th Annual !CM Symposium on Computational Geometry, Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, 162-171
   
1. The rectangle enclosure and point-dominance problems revisited
   Prosenjit Gupta, Ravi Janardan, Michiel Smid, and Bhaskar Dasgupta
   In: 11th Annual ACM Symposium on Computing Geometry, 1995, 162-171