A new linear algorithm for intersecting convex polygons (Q3316124)
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 linear algorithm for intersecting convex polygons |
scientific article; zbMATH DE number 3846359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new linear algorithm for intersecting convex polygons |
scientific article; zbMATH DE number 3846359 |
Statements
A new linear algorithm for intersecting convex polygons (English)
0 references
1982
0 references
kernel of a polygon
0 references
angular sectors
0 references
0.9518207907676696
0 references
0.8778517842292786
0 references
0.8500719666481018
0 references
0.8256385326385498
0 references
