A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0031-3203(87)90067-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988025634 / rank | |||
Normal rank | |||
Revision as of 19:44, 19 March 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
