An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507)
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 computing the minimum vertex distance between two crossing convex polygons |
scientific article; zbMATH DE number 3839214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons |
scientific article; zbMATH DE number 3839214 |
Statements
An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (English)
0 references
1984
0 references
algorithms
0 references
complexity
0 references
computational geometry
0 references
convex polygons
0 references
minimum distance
0 references
Voronoi diagrams
0 references
0 references
