def getLoopsUnified(importRadius, loopLists):
 allPoints = []
 corners = getLoopsListsIntersections(loopLists)
 radiusSide = (0.01 * importRadius)
 intercircle.directLoopLists(True, loopLists)
 for loopListIndex in xrange(len(loopLists)):
  insetLoops = loopLists[loopListIndex]
  inBetweenInsetLoops = getInBetweenLoopsFromLoops(importRadius, insetLoops)
  otherLoops = euclidean.getConcatenatedList((loopLists[:loopListIndex] + loopLists[(loopListIndex + 1):]))
  corners += getInsetPointsByInsetLoops(insetLoops, False, otherLoops, radiusSide)
  allPoints += getInsetPointsByInsetLoops(inBetweenInsetLoops, False, otherLoops, radiusSide)
 allPoints += corners[:]
 return trianglemesh.getDescendingAreaLoops(allPoints, corners, importRadius)

def getLoopsUnified ( importRadius , loopLists ) : allPoints = [ ] corners = getLoopsListsIntersections ( loopLists ) radiusSide = ( 0.01 * importRadius ) intercircle . directLoopLists ( True , loopLists ) for loopListIndex in xrange ( len ( loopLists ) ) : insetLoops = loopLists [ loopListIndex ] inBetweenInsetLoops = getInBetweenLoopsFromLoops ( importRadius , insetLoops ) otherLoops = euclidean . getConcatenatedList ( ( loopLists [ : loopListIndex ] + loopLists [ ( loopListIndex + 1 ) : ] ) ) corners += getInsetPointsByInsetLoops ( insetLoops , False , otherLoops , radiusSide ) allPoints += getInsetPointsByInsetLoops ( inBetweenInsetLoops , False , otherLoops , radiusSide ) allPoints += corners [ : ] return trianglemesh . getDescendingAreaLoops ( allPoints , corners , importRadius )
get joined loops sliced through shape .