Efficient algorithms for counting and reporting pairwise intersections between 
convex polygons

Gupta, Prosenjit; Janardan, Ravi; Smid, Michiel

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-35BC-8

要旨

要旨はありません