A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons |
scientific article; zbMATH DE number 4066320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons |
scientific article; zbMATH DE number 4066320 |
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
