A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Solving Minimum Distance Problems With Convex or Concave Bodies Using Combinatorial Global Optimization Algorithms

2005
*
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
*

Determining the minimum distance between convex objects is a problem that has been solved using many different approaches. On the other hand, computing the minimum distance between combinations of convex and concave objects is known to be a more complicated problem. Most methods propose to partition the concave object into convex sub-objects and then solve the convex problem between all possible sub-object combinations. This can add a large computational expense to the solution of the minimum

doi:10.1109/tsmcb.2005.850172
pmid:16366241
fatcat:5flonohyife27gacwpxhbxm24u