Efficient Algorithms for Counting and Reporting Pairwise Intersections Between 
Convex Polygons

Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons

MPS-Authors

/persons/resource/persons44551

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

/persons/resource/persons45509

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

External Resource

http://www.cccg.ca/proceedings/1996/cccg1996_0002.pdf
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

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. In F. Fiala, & E. Kranakis (Eds.), Proceedings of the 8th Canadian Conference on Computational Geometry (pp. 8-13). Ottawa: Carleton University Press.

Cite as: https://hdl.handle.net/21.11116/0000-000E-444D-0

Abstract

There is no abstract available