Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons (Q3312804)
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: Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons |
scientific article; zbMATH DE number 3842606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons |
scientific article; zbMATH DE number 3842606 |
Statements
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons (English)
0 references
1983
0 references
convex polygon
0 references
minimum distance between two polygons
0 references
intersection detection problem
0 references
0.8261046409606934
0 references
0.8231846690177917
0 references
0.8223217725753784
0 references
0.8142651319503784
0 references
