Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:11, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for counting and reporting pairwise intersections between convex polygons |
scientific article |
Statements
Efficient algorithms for counting and reporting pairwise intersections between convex polygons (English)
0 references
16 June 2016
0 references
computational geometry
0 references
data structures
0 references
