An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900)
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: An optimal algorithm for solving collision distance between convex polygons in plane |
scientific article; zbMATH DE number 495839
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for solving collision distance between convex polygons in plane |
scientific article; zbMATH DE number 495839 |
Statements
An optimal algorithm for solving collision distance between convex polygons in plane (English)
0 references
7 February 1994
0 references
initial collision vertex
0 references
effective collision edge
0 references
packing problem
0 references
collision distance
0 references
planar convex polygons
0 references
0.9079025
0 references
0.8915852
0 references
0.8889345
0 references
0.88621724
0 references
0.8777641
0 references
0.8744553
0 references
