title: Computing Minkowski Difference For Circles and Convex Polygons
body: <p>I'm needing to implement a Minkowski sum function that can return the Minkowski sum of either 2 circles, 2 convex polygons or a circle and a convex polygon. I found <a href="http://www.cs.rug.nl/~bekker/publications/bekker001.PS" rel="nofollow">this</a> thread that explained how to do this for convex polygons, but I'm not sure how to do this for a circle and polygon. Also, how would I even represent the answer?! I'd like the algorithm to run in O(n) time but beggars can't be choosers.</p>