def getSimplifiedInsetFromClockwiseLoop(loop, radius):
 inset = []
 for (pointIndex, begin) in enumerate(loop):
  center = loop[((pointIndex + 1) % len(loop))]
  end = loop[((pointIndex + 2) % len(loop))]
  addInsetPointFromClockwiseTriple(begin, center, end, inset, radius)
 return getWithoutIntersections(euclidean.getSimplifiedLoop(inset, radius))

def getSimplifiedInsetFromClockwiseLoop ( loop , radius ) : inset = [ ] for ( pointIndex , begin ) in enumerate ( loop ) : center = loop [ ( ( pointIndex + 1 ) % len ( loop ) ) ] end = loop [ ( ( pointIndex + 2 ) % len ( loop ) ) ] addInsetPointFromClockwiseTriple ( begin , center , end , inset , radius ) return getWithoutIntersections ( euclidean . getSimplifiedLoop ( inset , radius ) )
get loop inset from clockwise loop .