def getIsIntersectingWithinList(loop, loopList):
 leftPoint = euclidean.getLeftPoint(loop)
 for otherLoop in loopList:
  if ((euclidean.getNumberOfIntersectionsToLeft(otherLoop, leftPoint) % 2) == 1):
   return True
 return euclidean.isLoopIntersectingLoops(loop, loopList)

def getIsIntersectingWithinList ( loop , loopList ) : leftPoint = euclidean . getLeftPoint ( loop ) for otherLoop in loopList : if ( ( euclidean . getNumberOfIntersectionsToLeft ( otherLoop , leftPoint ) % 2 ) == 1 ) : return True return euclidean . isLoopIntersectingLoops ( loop , loopList )
determine if the loop is intersecting or is within the loop list .