def getWidenedLoop(loop, loopList, outsetLoop, radius):
 intersectingWithinLoops = getIntersectingWithinLoops(loop, loopList, outsetLoop)
 if (len(intersectingWithinLoops) < 1):
  return loop
 loopsUnified = booleansolid.getLoopsUnified(radius, [[loop], intersectingWithinLoops])
 if (len(loopsUnified) < 1):
  return loop
 return euclidean.getLargestLoop(loopsUnified)

def getWidenedLoop ( loop , loopList , outsetLoop , radius ) : intersectingWithinLoops = getIntersectingWithinLoops ( loop , loopList , outsetLoop ) if ( len ( intersectingWithinLoops ) < 1 ) : return loop loopsUnified = booleansolid . getLoopsUnified ( radius , [ [ loop ] , intersectingWithinLoops ] ) if ( len ( loopsUnified ) < 1 ) : return loop return euclidean . getLargestLoop ( loopsUnified )
get the widened loop .