A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons |
scientific article |
Statements
A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (English)
0 references
1987
0 references
computational geometry
0 references
convex polygons
0 references
2-dimensional linear programming
0 references
intersection
0 references
