Efficient Algorithms for Counting and Reporting Pairwise Intersections Between 
Convex Polygons

Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel

Local TagsRelease HistoryDetailsSummary

Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-444D-0 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-444E-F

Genre: Conference Paper

Files

show Files

Locators

show

hide

Locator:
http://www.cccg.ca/proceedings/1996/cccg1996_0002.pdf (Any fulltext) Open Access status unknown

Description:
-

OA-Status:
Not specified

Creators

show

hide

Creators:
Gupta, Prosenjit¹, Author
Janardan, Ravi², Author
Smid, Michiel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1996

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Gupta-et-al_CCCG96

Degree: -

Event

show

hide

Title: 8th Canadian Conference on Computational Geometry

Place of Event: Ottawa, Canada

Start-/End Date: 1996-08-12 - 1996-08-15

Legal Case

show

Project information

show

Source 1

show

hide

Title: Proceedings of the 8th Canadian Conference on Computational Geometry

Abbreviation : CCCG 1996

Source Genre: Proceedings

Creator(s):
Fiala, Frank¹, Editor
Kranakis, Evangelos¹, Editor
Sack, Jörg-Rüdiger¹, Author

Affiliations:
1 External Organizations, ou_persistent22

Publ. Info: Ottawa : Carleton University Press

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 8 - 13 Identifier: ISBN: 0-88629-307-3