Finding a best approximation pair of points for two polyhedra.

Ron Aharoni Yair Censor Zilin Jiang

Published in: Comput. Optim. Appl. (2018)

Keyphrases

convex hull
extreme points
special case
convex sets
continuous functions
three dimensional
pairwise
approximation algorithms
critical points
polygonal approximation
learning algorithm
high dimensional
data points
candidate pairs