Compute minimum distance between two convex polygons in 2d

213 Views Asked by At

The points of each polygon are given in a clockwise direction. We can assume that they don't intersect. Can we calculate the distance between two convex polygons in 2D in linear or log time? A naive approach would be to enumerate all vertices and segments and compute their distance, and I would like to improve from this O(n^2) time complexity.