An algorithm for computing the Euclidean distance between a pair of convex sets in R/sup m/ is described. Extensive numerical experience with a broad family of polytopes in R/sup 3/ shows that the ...

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment ...