de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Efficient algorithms for counting and reporting pairwise intersections between convex polygons

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44551

Gupta,  Prosenjit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

1996-1-008
(Any fulltext), 10KB

Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-A19E-0
Abstract
There is no abstract available