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. (1999). Efficient algorithms for counting and reporting pairwise intersections between convex polygons. Information Processing Letters, 69(1), 7-13.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35BC-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-35BD-6

Genre: Journal Article

Files

show Files

Locators

show

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

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1999

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 518020
Other: Local-ID: C1256428004B93B8-F9E67FF341500DDEC125675F0031250D-GuptaJanardanSmid99

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 69 (1) Sequence Number: - Start / End Page: 7 - 13 Identifier: -