The problem considered is to locate a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of points. The paper describes several possible application areas and shows the existence of a finite set of candidates for the optimal solution. A combinatorial algorithm is presented for the problem in three dimensions, and it is compared with existing nonconvex programming algorithms.
No takes yet. Share an insight, caveat, or question.
Dasarathy et al. (1980) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: