def getIsInsetPointInsideLoops(inside, loops, pointBegin, pointCenter, pointEnd, radius):
 centerMinusBegin = euclidean.getNormalized((pointCenter - pointBegin))
 centerMinusBeginWiddershins = complex((- centerMinusBegin.imag), centerMinusBegin.real)
 endMinusCenter = euclidean.getNormalized((pointEnd - pointCenter))
 endMinusCenterWiddershins = complex((- endMinusCenter.imag), endMinusCenter.real)
 widdershinsNormalized = (euclidean.getNormalized((centerMinusBeginWiddershins + endMinusCenterWiddershins)) * radius)
 return (euclidean.getIsInFilledRegion(loops, (pointCenter + widdershinsNormalized)) == inside)

def getIsInsetPointInsideLoops ( inside , loops , pointBegin , pointCenter , pointEnd , radius ) : centerMinusBegin = euclidean . getNormalized ( ( pointCenter - pointBegin ) ) centerMinusBeginWiddershins = complex ( ( - centerMinusBegin . imag ) , centerMinusBegin . real ) endMinusCenter = euclidean . getNormalized ( ( pointEnd - pointCenter ) ) endMinusCenterWiddershins = complex ( ( - endMinusCenter . imag ) , endMinusCenter . real ) widdershinsNormalized = ( euclidean . getNormalized ( ( centerMinusBeginWiddershins + endMinusCenterWiddershins ) ) * radius ) return ( euclidean . getIsInFilledRegion ( loops , ( pointCenter + widdershinsNormalized ) ) == inside )
determine if the inset point is inside the loops .