MPI-I-96-1-008
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel
MPI-I-96-1-008. March 1996, 11 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Acknowledgement:
References to related material:
| To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
|---|
  | 217 KBytes; 194 KBytes |
| Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1996-1-008
BibTeX
@TECHREPORT{GuptaJanardanSmid96a,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
TITLE = {Efficient algorithms for counting and reporting pairwise intersections between convex polygons},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-96-1-008},
MONTH = {March},
YEAR = {1996},
ISSN = {0946-011X},
}
