def minkowskiHull(a, b):
 points = numpy.zeros(((len(a) * len(b)), 2))
 for n in xrange(0, len(a)):
  for m in xrange(0, len(b)):
   points[((n * len(b)) + m)] = (a[n] + b[m])
 return convexHull(points.copy())

def minkowskiHull ( a , b ) : points = numpy . zeros ( ( ( len ( a ) * len ( b ) ) , 2 ) ) for n in xrange ( 0 , len ( a ) ) : for m in xrange ( 0 , len ( b ) ) : points [ ( ( n * len ( b ) ) + m ) ] = ( a [ n ] + b [ m ] ) return convexHull ( points . copy ( ) )
calculate the minkowski hull of 2 convex polygons .