A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (Q5288735)
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 DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES |
scientific article; zbMATH DE number 270033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES |
scientific article; zbMATH DE number 270033 |
Statements
A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES (English)
0 references
17 August 1993
0 references
separating-hyperplane algorithm
0 references
nearest pair of points
0 references
polytopes
0 references
0.91935056
0 references
0.91329193
0 references
0.9100248
0 references
0.9026405
0 references
0.8946979
0 references
0.8926274
0 references
0.8754415
0 references
0.8748015
0 references
